#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int T = 1;
void solve() {
    vector<int> v(33);
    for (int i = 1; i <= 32; i++)
        cin >> v[i];
    ll china = v[1];
    sort(v.begin() + 1, v.end());
    int pos = -1;
    for (int i = 1; i <= 32; i++)
        if (v[i] == china) {
            pos = i;
            break;
        }
    if (pos == 32)
        cout << 1;
    else if (pos >= 28)
        cout << 2;
    else if (pos >= 14)
        cout << 4;
    else if (pos >= 7)
        cout << 8;
    else if (pos >= 3)
        cout << 16;
    else
        cout << 32;
    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> T;
    while (T--)
        solve();
}