#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;



int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int t;
    cin >> t;

    for (int tt = 1; tt <= t; tt++) {
        int n;
        cin >> n;

        vector<string> A(n), B(n);
        for (int i = 0; i < n; i++) {
            cin >> A[i] >> B[i];
        }

        constexpr int MAXANS = 6;
        int answer = MAXANS;
        vector<int> sol = {0, 0, MAXANS};

        vector<string> temp(n);

        for (int a = 0; a <= MAXANS; a++) {
            for (int b = 0; a + b <= MAXANS; b++) {
                if (a + b > answer) continue;

                for (int i = 0; i < n; i++) {
                    temp[i] = A[i].substr(0, a) + B[i].substr(0, b);
                }

                sort(temp.begin(), temp.end());

                auto Get = [](int x) {
                    int pw = 1, e = 0;
                    while (pw < x) {
                        pw *= 10;
                        e++;
                    }
                    return e;
                };

                int c = 0;
                int i = 0;
                while (i < n) {
                    int j = i;
                    while (j < n && temp[i] == temp[j]) {
                        j++;
                    }
                    c = max(c, Get(j - i));
                    i = j;
                }

                if (answer > a + b + c) {
                    answer = a + b + c;
                    sol = {a, b, c};
                }
            }
        }
        
        if (answer == 0) {
            sol[2] = 1;
        }
        cout << sol[0] << " " << sol[1] << " " << sol[2] << "\n"; 
    }   

    return 0;
}