#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
const int MAXN = 4001;
const int C = 250;
const int P = 1000;
const ld EE = 2.7182818284590452353602874713527;
const ld INF = 1e+20;
struct Array {
  ld a[P + MAXN];
  Array() {
    for (int i = 0; i < P + MAXN; i++) a[i] = -INF;
  }
  ld& operator[](int x) { return a[x + P + 3]; }
};
Array p[2][P + 2];
int x[C];
ld fact[MAXN];
ld Poisson(int p, int k) { return logl(p) * k - logl(EE) * p - fact[k]; }
void PreCalc() {
  for (int i = 1; i <= P; i++) {
    for (int j = 0; j < MAXN; j++) {
      ld pp = Poisson(i, j);
      p[1][i][j] = Poisson(i, j);
    }
  }
  for (int i = 1; i <= P; i++) {
    for (int j = 0; j <= 2 * i; j++) {
      ld lg = -logl(2 * i + 1);
      p[0][i][j] = lg;
    }
  }
}
void Solve() {
  ld mx = -INF;
  int tp = -1;
  int cn = -1;
  for (int i = 0; i < C; i++) {
    cin >> x[i];
    x[i] = min(x[i], MAXN - 1);
  }
  for (int t = 0; t < 2; t++) {
    for (int i = 1; i <= P; i++) {
      ld c = 0;
      for (int j = 0; j < C; j++) {
        c += p[t][i][x[j]];
      }
      if (c > mx) mx = c, tp = t, cn = i;
    }
  }
  cout << cn << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(20);
  fact[0] = 0;
  for (int i = 1; i < MAXN; i++) fact[i] = fact[i - 1] + logl(i);
  PreCalc();
  int v;
  cin >> v;
  for (int i = 0; i < v; i++) Solve();
  return 0;
}
