#include <bits/stdc++.h>
using namespace std;
const char el = '\n';
typedef long long ll;
const int inf = 1e9;
int digit(int n) {
  if (n <= 1) return 0;
  n--;
  int res = 0;
  while (n) res++, n /= 10;
  return res;
}
int solve(vector<pair<string, string>> &s, int a, int b) {
  unordered_map<string, int> cnt;
  for (auto &[fir, lst] : s) {
    string f(fir.begin(), min(fir.end(), fir.begin() + a));
    string l(lst.begin(), min(lst.end(), lst.begin() + b));
    cnt[f + l]++;
  }
  int res = 0;
  for (auto [k, v] : cnt) res = max(res, digit(v));
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << setprecision(15);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    vector<pair<string, string>> s(n);
    for (auto &[fir, lst] : s) cin >> fir >> lst;
    int a = 0, b = 0, c = 10;
    for (int i = 0; i < 10; i++)
      for (int j = 0; j < 10; j++)
        if (i + j < 10) {
          int k = solve(s, i, j);
          if (i + j + k < a + b + c) a = i, b = j, c = k;
        }
    if (a == 0 && b == 0 && c == 0) c = 1;
    cout << a << ' ' << b << ' ' << c << el;
  }
  return 0;
}