#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 50;

int n;
string a[N], b[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i] >> b[i];
    int ans = 10, ans_x, ans_y, ans_z;
    for (int x = 0; x <= 6; x++)
        for (int y = 0; x + y <= 6; y++) {
            for (int z = 0; x + y + z <= 6; z++) {
                if (x + y + z == 0)
                    continue;
                set<string> s;
                map<string, int> ss;
                bool flag = true;
                for (int k = 1; k <= n; k++) {
                    string now;
                    now += a[k].substr(0, min(x, (int)a[k].size()));
                    now += b[k].substr(0, min(y, (int)b[k].size()));
                    if (now.empty()) now = "!";
                    if (z > 0) {
                        int cnt = ss[now];
                        if (to_string(cnt).size() > z){
                            flag = false;
                            break;    
                        }
                        ss[now]++;
                        now += to_string(cnt);
                    }
                    if (s.find(now) == s.end())
                        s.insert(now);
                    else {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    if (x + y + z < ans) {
                        ans = x + y + z;
                        ans_x = x, ans_y = y, ans_z = z;
                    }
                }
            }
        }
    cout << ans_x << " " << ans_y << " " << ans_z << "\n";
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int z;
    cin >> z;
    while (z--)
        solve();
    return 0;
}