#include "bits/stdc++.h"

using namespace std;

#define mxn 1e5+5
#define fastio ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define endl '\n'
#define INF 0x3f3f3f3f
typedef long long ll;

int solve(){
    int n;
    cin >> n;
    vector<pair<string, string> > v(n+1);

    for(int i=1; i<=n; i++){
        cin >> v[i].first >> v[i].second;
    }
    if(n==1){
        cout << "1 0 0" << endl;
        return 0;
    }
    int newn = n;
    newn--;
    int m=0;
    if(newn>0){
        string num = to_string(newn);
        m = (int)num.size();
    }
    int resp=m;
    int ar = 0, br = 0, cr = 0;
    for(int a=0; a<=m; a++){
        for(int b=0; b<=m; b++){
            map<string, int> mapa;
            for(int i=1; i<=n; i++){
                string as = v[i].first.substr(0, min(a, (int)v[i].first.size()));
                string bs = v[i].second.substr(0, min(b, (int)v[i].second.size()));
                mapa[as+bs]++;
            }
            int maior=0;
            for(auto it=mapa.begin(); it!=mapa.end(); it++){
                pair<string, int> agr = *it;
                maior=max(maior, agr.second);
            }
            int best=0;
            maior--;
            if(maior>0){
                string agr = to_string(maior);
                best = (int)agr.size();
            }
            if(a+b+best<=resp){
                resp=a+b+best;
                ar=a, br=b, cr=best;
            }
        }
    }
    cout << ar << " " << br << " " << cr << endl;
    return 0;
}

int main(){
    fastio;

    int t = 1; 
    cin >> t;

    while(t--){
        solve();
    }

    return 0;
}