#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;

/*---------------------------------------*/

void solve()
{
    int n;
    cin>>n;
    string s;
    vector<pair<string,string>>use;
    for(int i=1;i<=n;++i){
        while(s.size()<3)
            getline(cin,s,'\n');
        string a,b;
        int pos=0;
        while(s[pos]!=' ')
            a+=s[pos],pos++;
        pos++;
        for(int i=pos;i<s.size();++i)
            b+=s[i];
        use.emplace_back(a,b);
        s.clear();
    }

    for(int i=1;i<=6;++i){
        for(int u=0;u<=i;++u)
            for(int v=0;v+u<=i;++v){
                int k=i-v-u;

                __gnu_pbds::gp_hash_table<string,int>mp;
                for(const auto& [x,y]:use){
                    string s;
                    if(x.size()<=u)
                        s+=x;
                    else
                        s+=x.substr(0,u);
                    if(y.size()<=v)
                        s+=y;
                    else
                        s+=y.substr(0,v);

                    mp[s]++;
                }
                bool flag=true;
                for(const auto& [key,val]:mp){
                    if(to_string(val).size()>k){
                        flag=false;
                        break;
                    }
                }

                if(flag){
                    cout<<u<<' '<<v<<' '<<k<<'\n';
                    return;
                }
            }
    }
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}