#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

#define N 50005

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

pi a[N];

void solve(){
    int n=32;
    for(int i=1;i<=n;i++){
        int x=read();a[i]=mp(x,i);
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(a[i].se!=1)continue;
        if(i>=32)write(1);
        else if(i>=28)write(2);
        else if(i>=14)write(4);
        else if(i>=7)write(8);
        else if(i>=3)write(16);
        else write(32);
        break;
    }
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif
    int T=read();while(T--)solve();
    return 0;
}