#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define trav(a, x) for(auto& a : x)
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define ROF(i, a, b) for (int i=(a); i>=(signed)(b); i--)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define vi vector<int>
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
typedef long long ll;

const ll mod = 1e9 + 7;

int lgg (int n) {
    int p = 0;
    while(n) {
        p++;
        n /= 10;
    }
    return p;
}

int main() 
{	
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--) {
        int n; cin >> n;
        vector<string> f(n), l(n);
        F0R(i, n) cin >> f[i] >> l[i];
        int sum = lgg(n), a=0,b=0,c=lgg(n);
        FOR(len, 1, lgg(n)) {
            FOR(k, 0, len) {
                map<string, int> cnt;
                int aaaa = 0;
                F0R(_,n) {
                    string lef = f[_].substr(0, min(k, (int)f[_].size()));
                    string rit = l[_].substr(0, min(len-k, (int)l[_].size()));
                    string ehre = lef+rit;
                    cnt[ehre]++;
                    int uu = cnt[ehre];
                    if(uu > aaaa) aaaa = uu; 
                }
                if(len+lgg(aaaa-1) < sum) {
                    sum = len+lgg(aaaa-1);
                    a = k, b = len-k, c = lgg(aaaa-1);
                }
            }
        }
        cout << a << " " << b << " " << c << "\n";
    }
    return 0;
}