#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<ll, ll>
#define endl '\n'
#define mp make_pair
#define M(x) x%=mod,x+=mod,x%=mod;
#define FOR(i,j,k) for(int i=(j);i<=(k);i++)
#define ROF(i,j,k) for(int i=(j);i>=(k);i--)
#define ANS cout<<ans<<endl;
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"No"<<endl;
typedef long long ll;
int a0,n,ans;

inline void solve(){
    vector<ll> a(32);
    FOR(i,0,31){
        cin>>a[i];
    }
    ll pl=0;
    a0=a[0];
    sort(a.begin(),a.end());
    FOR(i,0,31){
        if(a[i]==a0){
            pl=i+1;
        }
    }
    if(pl<=2){
        ans=32;
    }else if(pl<=4){
        ans=16;
    }else if(pl<=8){
        ans=8;
    }else if(pl<=14){
        ans=4;
    }else if(pl<=31){
        ans=2;
    }else{
        ans=1;
    }

    ANS


}

int main(){
    cout << fixed << setprecision(10);
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t=0;
    cin >> t;
    while(t--)solve();
    return 0;
}