#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

void solve()
{

    int n;
    cin >> n;
    vector<string> s1(n), s2(n);
    fr(i, 0, n - 1)
    {
        cin >> s1[i] >> s2[i];
    }
    vector<int> pw(10);
    pw[0] = 1;
    for (int i = 1; i <= 7; i++)
        pw[i] = pw[i - 1] * 10;
    for (int sum = 1; sum <= 7; sum++)
    {
        fr(a, 0, sum)
        {
            fr(b, 0, sum - a)
            {
                int c = sum - a - b;
                int mx = 0;
                map<string, int> mp;
                for (int i = 0; i < n; i++)
                {
                    auto k1 = s1[i].substr(0, a);
                    auto k2 = s2[i].substr(0, b);
                    auto k = k1 + k2;
                    mx = max(mx, ++mp[k]);
                    if (mx > pw[c])
                        break;
                }
                if (mx <= pw[c])
                {
                    cout << a << " " << b << " " << c << endl;
                    return;
                }
            }
        }
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}