#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=2e5+9;
ll T,n;
string s[N],t[N];
map<string,ll>mp;
ll runi(ll x){
    ll len=0;
    while(x)len++,x/=10;
    return len;
}
void solve(){
    cin>>n;
    rep(i,1,n)cin>>s[i]>>t[i];
    ll A=0,B=0,C=6;
    rep(a,0,6){
        rep(b,0,6){
            if(a+b>=6)break;
            mp.clear();
            rep(i,1,n){
                string str1,str2;
                if(s[i].size()>=a)str1=s[i].substr(0,a);
                else str1=s[i];
                if(t[i].size()>=b)str2=t[i].substr(0,b);
                else str2=t[i];
                str1+=str2;
                mp[str1]++;
            }
            ll c=0;
            for(pair<string,ll>p:mp)c=max(c,runi(p.second));
            if(!(a+b+c))c++;
            if(a+b+c<A+B+C)A=a,B=b,C=c;
        }
    }
    cout<<A<<" "<<B<<" "<<C<<"\n";
}
bool Med;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    cin>>T;
    while(T--)solve();
    return 0;
}