#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>

using namespace std;

map<string,int>tree;
map<string,int>::iterator it;
int N,Q;

int main()
{
	freopen("nickname.in","r",stdin);
	freopen("nickname.out","w",stdout);
	scanf("%d",&Q);
	while(Q--)
	{
		scanf("%d\n",&N);
		for(int i=1;i<=N;i++)
		{
			string str;
			cin>>str;
			for(int j=0;j<str.length();j++)
				if(str[j]<='Z')
					str[j]+=26;
			tree[str]++;
		}
		for(it=tree.begin();it!=tree.end();it++)
			printf("%s %d\n",it->first.c_str(),it->second);
		tree.clear();
	}
	return 0;
}