#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <queue>   
#include <cmath>
#include <string>
#include <cstring>
using namespace std;
struct In
{
	char str[101];
	int num;
}name[100001];

int cmp(const void *a,const void *b)
{
	struct In *c=(struct In *)a;
	struct In *d=(struct In *)b;
	return strcmp(c->str , d->str);
}

int main() 
{
    ifstream in ("nickname.in");
    ofstream out ("nickname.out");
	int N;
	int n;
	bool bo[100001];
	in>>N;
	for(int z=0;z<N;z++)
	{
		int i,j;
		in>>n;
		for(i=1;i<=n;i++)
		{
			in>>name[i].str;
			name[i].num=1;
			bo[i]=true;
		}
		qsort(name+1,n,sizeof(name[0]),cmp);
		for(i=1;i<n;i++)
		{
			if(bo[i]==true)
			{
				for(j=i+1;j<=n;j++)
				{
					if(strcmp(name[i].str,name[j].str)==0)
					{
						name[i].num++;
						name[j].num=0;
						bo[j]=false;
					}
					else
						break;
				}
			}
		}
		for(i=1;i<=n;i++)
			if(bo[i]==true&&name[i].num>0)
				out<<name[i].str<<' '<<name[i].num<<endl;
	}
    return 0;
}