#include"bits/stdc++.h"

using lint = int64_t;

constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x63636363;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x6363636363636363;

using namespace std;

void solve(){
    int n; cin>>n;
    vector<array<string, 2>> v(n);
    for(auto &name : v)
        cin>>name[0]>>name[1];
    
    tuple<int, int, int, int> ans = {3*n, n, n, n};
    auto get_ans = [&](int a, int b) -> tuple<int, int, int, int> {
        map<array<string, 2>, int> cnt;
        int maxi_cnt = 0;
        for(auto name : v){
            array<string, 2> cur = {name[0].substr(0, a), name[1].substr(0, b)};
            maxi_cnt = max(maxi_cnt, ++cnt[cur]);
        }
        int c = 0;
        maxi_cnt--;
        while(maxi_cnt > 0){
            maxi_cnt /= 10;
            c++;
        }
        if(a == 0 && b == 0 && c == 0)
            c = 1;
        return {a+b+c, a, b, c};
    };
    for(int tot = 0; tot <= 7; tot++)
        for(int a = 0; 2*a <= tot; a++){
            int b = tot - a;
            ans = min(ans, get_ans(a, b));
        }
    auto [cost, a, b, c] = ans;
    cout<<a<<' '<<b<<' '<<c<<"\n";
}


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