#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 3e5 + 5;

int ask(int x) {
    cout << x << endl;
    cin >> x;
    return x;
}

int lg10(ll x) {
    int pw = 0;
    int cur = 1;
    while (cur < x) {
        pw++;
        cur *= 10;
    }
    return pw;
}

void solve() {
    int n;
    cin >> n;
    vector<pair<string, string>> a(n);
    for (auto &[x, y]: a) cin >> x >> y;
    pair<pair<int, int>, int> ans = {{0, 0},
                                     {lg10(n)}};
    for (int i = 0; i <= lg10(n); ++i) {
        for (int j = 0; i + j <= lg10(n); ++j) {
            map<string, int> cnt;
            for (auto [x, y] : a) {
                string cur;
                cur += string(x.begin(), x.begin() + min((int)x.size(), i));
                cur += string(y.begin(), y.begin() + min((int)y.size(), j));
                cnt[cur]++;
            }
            int mx = 0;
            for (auto &[x, y] : cnt) {
                mx = max(mx, lg10(y));
            }
            if (i + j + mx < ans.first.first + ans.first.second + ans.second) {
                ans = {{i, j}, mx};
            }
        }
    }
    cout << ans.first.first << ' ' << ans.first.second << ' ' << ans.second << '\n';
}

int main() {
#ifndef LOCAL
#else
    freopen("input.txt", "r", stdin);
#endif
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}