#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

unordered_map<string, int> mp;

void solve() {
    int mn = 6, sa = 0, sb = 0, sc = 6;
    int n;
    cin >> n;
    vector<pair<string, string>> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i].X >> v[i].Y;
    auto get = [&](const string &s, int x) {
        if (SZ(s) <= x)
            return s;
        else
            return s.substr(0, x);
    };
    for (int S = 0; S < 6 && S < mn; S++)
        for (int a = 0; a < 6; a++)
            for (int b = 0; b < 6; b++)
                if (a + b == S) {
                    mp.clear();   
                    for (int i = 0; i < n; i++) {
                        mp[get(v[i].X, a) + get(v[i].Y, b)] += 1;
                    }
                    int mx = 0;
                    for (auto p : mp)
                        mx = max(mx, p.Y);
                    int c = 0, cnt = 1;
                    while (cnt < mx)
                        c++, cnt *= 10;
                    if (a + b + c < mn)
                        sa = a, sb = b, sc = c, mn = a + b + c; 
                }
    cout << sa << " " << sb << " " << sc << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
}