#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
char ts[1600000];
char s1[210000][20],s2[210000][20];
int len1[210000],len2[210000];
int n,ansa,ansb,ansc;
int main()
{
	int T;
	cin>>T;
	while (T--)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			int len;
			scanf("%s",ts+1);
			len1[i]=strlen(ts+1);
			for(int j=1;j<=min(10,len1[i]);j++)s1[i][j]=ts[j];

			scanf("%s",ts+1);
			len2[i]=strlen(ts+1);
			for(int j=1;j<=min(10,len2[i]);j++)s2[i][j]=ts[j];
		}
		int ans=2147483647;
		for(int a=0;a<=10;a++)
		for(int b=0;b<=10;b++)
		{
                         if (a+b>6)continue;
			static map<string,int> dic; dic.clear();
			int maxcnt=0;
			for(int i=1;i<=n;i++)
			{
				string s="";
				for(int j=1;j<=min(a,len1[i]);j++)s+=s1[i][j];
				for(int j=1;j<=min(b,len2[i]);j++)s+=s2[i][j];
				dic[s]++;
				maxcnt=max(maxcnt,dic[s]);
			}
			int c=0; long long now=1;
			while (now<maxcnt)c++,now=now*10;
			if (a+b+c==0)c++;
			if (ans>a+b+c)ans=a+b+c,ansa=a,ansb=b,ansc=c;
		}
		printf("%d %d %d\n",ansa,ansb,ansc);
	}
	return 0;
}