#include<bits/stdc++.h>
const int N=1e5+5,M=305;
const int mod=1e9+7;
using namespace std;
#define int long long
int ksm(int a,int b){int res=1;for(;b;b>>=1,a=a*a%mod)if(b&1)res=res*a%mod;return res;}

void slcx()
{
    vector<pair<int,int>>a(32);
    for(int i = 0; i < 32; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin(),a.end());
    int idx = 0;
    for(int i = 0; i < 32; i++){
        if(a[i].second == 0){
            idx = i;
            break;
        }
    }
    if(idx >= 31){
        cout << 1 << endl;
    }
    else if(idx >= 27){
        cout << 2 << endl;
    }
    else if(idx >= 13){
        cout << 4 << endl;
    }
    else if(idx >= 6){
        cout << 8 << endl;
    }
    else if(idx >= 2){
        cout << 16 << endl;
    }
    else{
        cout << 32 << endl;
    }
}
int tt;
signed main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    tt=1;
    cin>>tt;
    while(tt--) slcx();
}