// qdd on Feb 12, 2023

#ifdef qdd
#include <ringo>
#else
#include <bits/stdc++.h>
#define dbg(...)
#define dbgr(x, y)
#endif

using namespace std;

using ll = long long;

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v) is >> x;
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  bool f = 0;
  for (const T& x : v) (f ? os << ' ' : os) << x, f = 1;
  return os;
}

const int N = 1e6 + 10;

int n;
string A[N], B[N];

int len(int x) {
  int bits = 0, can = 1;
  while (can < x) can *= 10, bits++;
  return bits;
}

int check(int a, int b) {
  unordered_map<string, int> mp;
  for (int i = 0; i < n; i++) {
    mp[A[i].substr(0, a) + B[i].substr(0, b)]++;
  }
  int ans = 0;
  for (auto& [x, y] : mp) {
    ans = max(ans, len(y));
  }
  return ans;
}

void sol() {
  cin >> n;
  int mxlen_A = 6, mxlen_B = 6;
  for (int i = 0; i < n; i++) {
    cin >> A[i] >> B[i];
    mxlen_A = min(mxlen_A, (int)A[i].size());
    mxlen_B = min(mxlen_B, (int)B[i].size());
  }
  if (n == 1) {
    cout << "0 0 1\n";
    return;
  }
  int a = 0, b = 0, c = 6, ans = 6;
  for (int i = 0; i <= mxlen_A; i++) {
    for (int j = 0; j <= mxlen_B && i + j <= 6; j++) {
      int k = check(i, j);
      if (i + j + k < ans) {
        ans = i + j + k;
        a = i;
        b = j;
        c = k;
      }
    }
  }
  cout << a << ' ' << b << ' ' << c << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  cin >> T;
  while (T--) {
    sol();
  }
  return 0;
}