// clang-format off
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(ref(*this), forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun)); }
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; }
sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; }
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
struct { template <class T> operator T() { T x; cin >> x; return x; } } in;
#define endl '\n'
#define pb emplace_back
#define vt vector
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using i64 = long long;
// clang-format on

void solve() {
    int n;
    cin >> n;
    vector<pair<string, string>> names(n);
    for (auto &[a, b] : names) {
        cin >> a >> b;
    }
    int minsum = INT_MAX;
    int ra, rb, rc;
    auto mypow = [&](int x, int y) {
        int r = 1;
        while (y--) {
            r *= x;
        }
        return r;
    };
    for (int a = 0; a <= 6; a++) {
        for (int b = 0; a + b <= 6; b++) {
            map<string, int> new_names;
            for (auto [x, y] : names) {
                string uname = x.substr(0, min(a, sz(x))) + y.substr(0, min(b, sz(y)));
                new_names[uname]++;
            }
            int ans = 0;
            for (auto [_, x] : new_names) {
                ans = max(ans, x);
            }
            int need_c = 1;
            for (int c = 0; c <= 6; c++) {
                if (ans <= mypow(10, c)) {
                    need_c = c;
                    break;
                }
            }
            if (a + b + need_c < minsum && a + b + need_c != 0) {
                minsum = a + b + need_c;
                ra = a;
                rb = b;
                rc = need_c;
            }
        }
    }
    cout << ra << " " << rb << " " << rc << endl;
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    // int t = 1;
    int t = in;
    while (t--) {
        solve();
    }
}