#include <bits/stdc++.h>

#define maxn 200005

using namespace std;

int n;
int lg[maxn];
string x[maxn];
string y[maxn];

unordered_map<string, int> mp;

struct node{
	int a, b, c;
	bool operator < (const node x) const {
		return a + b + c < x.a + x.b + x.c;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	for (int i = 1; i < maxn; i++) lg[i] = lg[i / 10] + 1;
	int T;
	cin >> T;
	while (T--) {
		cin >> n;
		node ans = {0, 0, lg[n]};
//		node ans = {11, 11, 11};
		for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
		for (int a = 0; a <= 6; a++) {
			for (int b = 0; a + b <= 6; b++) {
				if (a + b == 0) continue;
				for (int i = 1; i <= n; i++) {
					++mp[x[i].substr(0, a) + y[i].substr(0, b)];
				}
				node res = {0, 0, 0};
				for (auto p : mp) res = max(res, {a, b, lg[p.second]});
				ans = min(ans, res);
				mp.clear();
			}
		}
		printf("%d %d %d\n", ans.a, ans.b, ans.c);
	}
	
	return 0;
}