//I wrote this code 4 u today
#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

#define nd node*
#define pnd pair<nd, nd>

typedef long long ll;

template<const ll MOD>
struct mod_mul : std::multiplies<const ll> {
    ll operator()(const ll a, const ll b) {
        return (a * b) % MOD;
    }
};


template<typename T>
inline void sort(T &a) {
    std::sort(a.begin(), a.end());
}

template<typename T>
inline void unique(T &a) {
    a.resize(std::unique(a.begin(), a.end()) - a.begin());
}

template<typename T>
inline void reverse(T &a) {
    std::reverse(a.begin(), a.end());
}

const ll INF = 9023372036854775808ll;
const ll MOD = 1000000007ll;

using namespace std;

int main() {
    std::cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int z;
    cin >> z;
    while (z--) {
        int n;
        cin >> n;
        vc<pair<string, string>> z(n);
        for (auto &i: z) cin >> i.first >> i.second;
        array<int, 4> ans = {(int) 1e9, 0, 0, 0};
        for (int a = 0; a <= 10; ++a) {
            for (int b = 0; b + a <= 10; ++b) {
                unordered_map<string, int> cnt;
                for (int i = 0; i < n; ++i) {
                    string nw;
                    for (int j = 0; j < z[i].first.size() && j < a; ++j) nw.push_back(z[i].first[j]);
                    for (int j = 0; j < z[i].second.size() && j < b; ++j) nw.push_back(z[i].second[j]);
                    cnt[nw]++;
                }
                int mx = -1;
                for (auto &[x, y]: cnt) mx = max(mx, y);
                int w = 0, nw = 1;
                while (nw < mx) nw *= 10, ++w;
                ans = min(array<int, 4>{a + b + w, a, b, w}, ans);
            }
        }
        cout << ans[1] << ' ' << ans[2] << ' ' << ans[3] << '\n';
    }
}