#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n; cin >> n;
    vector<pair<string, string>> str(n);
    for(auto& [a, b] : str) {
        cin >> a >> b;
    }
    int ma = 0, mb = 0, mc = 6;
    int ans = 6;
    for(int a = 0; a < ans; a++) {
        for(int b = 0; a + b < ans; b++) {
            map<string, int> occs;
            for(auto& [x, y] : str) {
                string name = x.substr(0, a) + y.substr(0, b);
                occs[name]++;
            }
            int c = 0;
            for(auto& [_, i] : occs) {
                c = max(c, i);
            }
            auto dajlog = [&](int x) -> int {
                int a = 1;
                int wyk = 0;
                while(a < x) {
                    a *= 10;
                    wyk++;
                }
                return wyk;
            };
            c = dajlog(c);
            if(a + b + c < ans) {
                ma = a;
                mb = b;
                mc = c;
                ans = a + b + c;
            }
        }
    }
    if(ans == 0) mc = 1;
    cout << ma << " " << mb << " " << mc << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t; cin >> t;
    while(t--) solve();
}