#include <bits/stdc++.h>

#define lif " \n"
#define dbg(a) cout << #a << '=' << a << lif[1]
#define inf 0x3f3f3f3f
#define fi first
#define se second

using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using pii = pair<int, int>;
using pll = pair<i64, i64>;

void solve() {
    vector<pii> a(32);
    pii chi;
    chi.se = 0;
    for (int i = 0; i < 32; i++) {
        int t;
        cin >> t;
        if (!i) chi.fi = t;
        a[i] = {t, i};
    }
    sort(a.begin(), a.end());
    // for (auto [v, i] : a) cerr << v <<' ' << i << lif[1];
    // cerr << chi.fi << ' ' << chi.se << lif[1];
    auto it = lower_bound(a.begin(), a.end(), chi);
    int pre = a.end() - it -1;
    // cerr << pre << lif[1];
    int pre16 = pre / 4 * 2 + (pre % 4 > 2 ? 0 : pre % 4);
    int ans = 32;
    // cerr << pre16 << lif[1];
    while (pre16 < ans / 2) {
        ans /= 2;
        pre16 = (pre16 + 1) / 2;
        // cerr << pre16 << lif[1];
    }
    cout << ans << lif[1];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int  t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}