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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long long lint;

const int N = 200005;

int n;
string a[N], b[N];
map<int, int> mp;

bool can (int A, int B, int C) {
    mp.clear();
    int L = 1;
    for (int i=0;i<C;i++) {
        L *= 10;
    }
    for (int i=1;i<=n;i++) {
        int I = 0;
        for(int j=0;j<A;j++) {
            if (a[i].size() <= j) break;
            int X = (a[i].size() <= j ? 0 : a[i][j] - 'a' + 1);
            I = I * 27 + X;
        }
        for(int j=0;j<B;j++) {
            if (b[i].size() <= j) break;
            int X = (b[i].size() <= j ? 0 : b[i][j] - 'a' + 1);
            I = I * 27 + X;
        }
        if (++mp[I] > L) return false;
    }
    return true;
}

void solve () {
    cin >> n;
    for (int i=1;i<=n;i++) {
        cin >> a[i] >> b[i];
    }
    for (int x=1;;x++) {
        for (int a=0;a<=x;a++) for (int b=0;a+b<=x;b++) {
            int c = x - a - b;
            if (can(a, b, c)) {
                printf("%d %d %d\n", a, b, c);
                return;
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int TC;
    cin >> TC;
    // scanf("%d", &TC);
    while(TC--)
    {
        solve();
    }
}