#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 2000010
string s[N], t[N];
map<string, int>ma;
int n;
const int qlg(int x)
{
	int s = 0, w = 1;
	while (w < x)w *= 10, s ++;
	return s;
}
int sol(int p, int q)
{
	int ans = 0;
	for (int i = 1; i <= n; i ++)
	{
		string a = "";
		for (int j = 0; j < min(p, (int)s[i].length()); j ++)a += s[i][j];
		for (int j = 0; j < min(q, (int)t[i].length()); j ++)a += t[i][j];
		ans = max(ans, ++ma[a]);
	}
	ma.clear(); return ans;
}
void sol()
{
	cin >> n;
	for (int i = 1; i <= n; i ++)cin >> s[i] >> t[i];
	int ans = 6, A = 0, B = 0, C = 6;
	for (int a = 0; a <= 5; a ++)for (int b = 0; a + b <= 5; b ++)
		{
			int c = qlg(sol(a, b));
			if (a + b + c < ans)ans = a + b + c, A = a, B = b, C = c;
		}
	cout << A << ' ' << B << ' ' << C << '\n';
}
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T; cin >> T;
	while (T --)sol();
	return 0;
}