#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
int T;
int n;
// string stra[N], strb[N];
map<pair<string, string>, int> p;
pair<PII, int> res;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> T;
    while (T--)
    {
        cin >> n;
        vector<string> stra(n + 1), strb(n + 1);
        for (int i = 1; i <= n; i++)
            cin >> stra[i] >> strb[i];
        if (n == 1)
        {
            cout << "0 0 0" << endl;
            continue;
        }

        // int ans = log(n - 1) / log(2) + 1;
        int minv = 19;
        for (int a = 0; a <= minv; a++)
            for (int b = 0; a + b <= minv; b++)
            {
                p.clear();
                int cnt = 0;
                // cout << ':' << a << ' ' << b << endl;
                for (int i = 1; i <= n; i++)
                {
                    string ha = stra[i].substr(0, a), hb = strb[i].substr(0, b);
                    // cout << ha << ' ' << hb << endl;
                    int t = ++p[{ha, hb}];
                    cnt = max(cnt, t);
                }
                int c = cnt <= 1 ? 0 : log(cnt - 1) / log(10) + 1;
                // cout << cnt << ' ' << minv << ' ' << a + b + c << endl;
                if (minv > a + b + c)
                    minv = a + b + c, res = (pair<PII, int>){{a, b}, c};
            }
        cout << res.x.x << ' ' << res.x.y << ' ' << res.y << endl;
    }
    return 0;
}