#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll INF = 2e18;

const int maxn = 200010;

int n;

int lg[maxn];

string p[maxn], q[maxn];

int getMinC(int a, int b)
{
    int minC = 0;
    unordered_map<string,int> freq;

    for(int i = 1 ; i <= n ; i++)
    {
        int sizeFirst = min( a , (int)p[i].size() );
        int sizeLast = min( b , (int)q[i].size() );

        string alias = p[i].substr( 0 , sizeFirst ) + q[i].substr( 0 , sizeLast );

        freq[alias]++;

        if( ++freq[alias] > 1 )
            minC = max( minC , lg[ freq[alias] ] );
    }

    return minC;
}

void solve()
{
    cin >> n;

    for(int i = 1 ; i <= n ; i++)
        cin >> p[i] >> q[i];

    if( n == 1 )
    {
        cout << "0 0 1" << endl;
        return;
    }

    int optA = 0, optB = 0, optC = lg[n];

    for(int a = 0 ; a < optA + optB + optC ; a++)
    {
        for(int b = 0 ; a + b < optA + optB + optC ; b++)
        {
            int c = getMinC( a , b );
            int curSum = a + b + c;

            if( curSum < optA + optB + optC )
                optA = a, optB = b, optC = c;
        }
    }

    cout << optA << " " << optB << " " << optC << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    for(int i = 1 ; i < maxn ; i++)
        lg[i] = lg[i/10] + 1;

    int t;
    cin >> t;

    while( t-- )
        solve();

    return 0;
}