#include<bits/stdc++.h>
#define LL long long
using namespace std;

inline int read(){
	int x=0,f=1;char ch=' ';
	while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f==1?x:-x;
}

const int N=2e6+5;

int T,n;
string A[N],B[N];
map<string,int> mp;

int main(){
	T=read();
	while(T--){
		n=read();
		for(int i=1;i<=n;++i){
			cin>>A[i]>>B[i];
		}
		int ans=6,aa=0,bb=0,cc=6;
		for(int a=0;a<6;++a){
			for(int b=0;a+b<6;++b){
				mp.clear();
				for(int i=1;i<=n;++i){
					string s1=A[i].substr(0,min(a,(int)A[i].length()));
					string s2=B[i].substr(0,min(b,(int)B[i].length()));
					string s=s1+s2;
					if(mp.find(s)==mp.end())mp[s]=1;
					else mp[s]++;
				}
				int mx=1;
				for(auto x:mp)mx=max(mx,x.second);
				int c=0;
				int now=1;
				while(now<mx){
					now*=10;
					c++;
				}
				if(a+b+c<ans){
					ans=a+b+c;
					aa=a;
					bb=b;
					cc=c;
				}
			}
		}
		if(!aa && !bb && !cc)cc=1;
		printf("%d %d %d\n",aa,bb,cc);
	}
	return 0;
}