#include <bits/stdc++.h>

#define int long long
using namespace std;
typedef long long i64;
typedef pair<int, int> PII;

const int N = 2e5 + 10, p = 998244353;

int lowbit(int x) { return x & (-x); }

int fac26[N];

int qmi(int a, int b, int p) {
    int res = 1;
    while (b) {
        if (b & 1) res = res * a % p;
        a = a * a % p;
        b >>= 1;
    }
    return res;
}

bool cmp(int x, int y) { return x > y; }

void solve() {
    int cnt = 0, ans;
    vector<PII> a(32);
    for (int i = 0; i < 32; i++) cin >> a[i].first;
    sort(a.rbegin(), a.rend());
    for (int i = 1; i < 32; i++) {
        if (a[i] > a[0]) cnt++;
    }

    if (cnt <= 1) ans = 32;
    else if (cnt <= 5) ans = 16;
    else if (cnt <= 12) ans = 8;
    else if (cnt <= 26) ans = 4;
    else if (cnt <= 30) ans = 2;
    else ans = 1;
    cout << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}