#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;

/*---------------------------------------*/

void solve()
{
    int n;
    cin >> n;
    vector<pair<string, string>>v(n);
    for (auto& [x, y] : v)
        cin >> x >> y;

    int mi = iINF;
    int a, b, c;
    for (int i = 0;i <= 6;++i)
        for (int j = 0;j + i <= 6;++j) {
            map<string, int>mp;
            for (const auto& [x, y] : v) {
                mp[x.substr(0, min(int(x.size()), i)) + y.substr(0, min(int(y.size()), j))]++;
            }

            int k = 1;
            for (const auto& [key, val] : mp)
                k = max(k, val);

            k--;
            if (k)
                k = to_string(k).size();
            if (i + j + k < mi)
                a = i, b = j, c = k, mi = i + j + k;
        }

    cout << a << ' ' << b << ' ' << c << '\n';
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}