#include <bits/stdc++.h>
using namespace std;
using ll = long long;


struct User {
    string name, surname;
};

void solve() {
    int n; cin >> n;
    vector<User> users(n);
    for(auto& x: users) {
        cin >> x.name >> x.surname;
    }
    if (n == 1) {
        cout << "0 0 1\n";
        return;
    }

    auto check = [&](size_t a, size_t b) -> array<size_t, 3> {
        map<string, int> cnt;
        for (const auto& [name, surname] : users) {
            cnt[name.substr(0, min(a, name.size())) + surname.substr(0, min(b, surname.size()))]++;
        }

        int max_cnt = 0;
        for (const auto& [_, c] : cnt) {
            max_cnt = max(max_cnt, c);
        }
        return {a, b, max_cnt > 1 ? to_string(max_cnt).size() : 0};
    };

    array<size_t, 3> ans{};
    size_t best = 1000;
    for (size_t a = 0; a <= 6; ++a) {
        for (size_t b = 0; a + b <= 6; ++b) {
            auto cur_ans = check(a, b);
            auto cur_size = cur_ans[0] + cur_ans[1] + cur_ans[2];
            if (cur_size < best) {
                ans = cur_ans;
                best = cur_size;
            }
        }
    }
    for (int i = 0; i < 3; ++i) cout << ans[i] << " \n"[i == 2];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; cin >> t;
    while (t--) solve();
}