#include <bits/stdc++.h>
#include<unordered_map>

#define ll long long

using namespace std;

const ll N = 1e6 + 10, MM = 1e9 + 7, MAX = 1e18;


int solve() {
	int n; cin >> n;
	vector<pair<string, string>>v(n);
	int mx = 0, mx1 = 0;
	for (auto& x : v)cin >> x.first >> x.second, mx = max(mx, (int)x.first.size()), mx1 = max(mx1, (int)x.second.size());

	int nn = n;
	int cnt = 0;
	while (nn) {
		nn /= 10;
		cnt++;
	}
	unordered_map<string, ll>mp;
	ll res1 = 0, res2 = 0, res3 = cnt, res = cnt;

	for (int a = 0; a <= min(cnt, mx); a++) {
		for (int b = 0; b <= min(cnt, mx1); b++) {
			string ss = "";
			mp.clear();
			int mx = 0;
			for (auto& x : v) {
				ss = x.first.substr(0, min(a, (int)x.first.size())) + x.second.substr(0, min(b, (int)x.second.size()));
				mp[ss]++;
				mx = max(mx, (int)mp[ss]);
			}
			int sum = a + b;
			while (mx) {
				mx /= 10;
				sum++;
			}
			if (sum <= res) {
				res1 = a, res2 = b, res3 = sum - a - b;
				res = sum;
			}
		}
	}
	cout << res1 << " " << res2 << " " << res3 << '\n';
	return 0;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	int i = 1;
	while (t--) {
		//cout << "case " << i << ": ";
		solve();
	}
	return 0;
}
/*
204

*/