#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
typedef long long ll;
#define pll pair<ll,ll>
const int inf=0x3f3f3f3f;
const int N=1e5+5;
const int mod=99844854;
#define PI 3.1415926
#define fi first
#define se second
ll a[40],x;
void solve(){
	for(int i=1;i<=32;++i)cin>>a[i];
	x=a[1];
	sort(a+1,a+1+32);
	for(int i=1;i<=32;++i){
		if(a[i]==x){
			x=i;
			break;
		}
	}
	if(x==32)cout<<"1\n";
	else if(x>=28)cout<<"2\n";
	else if(x>=14)cout<<"4\n";
	else if(x>=7)cout<<"8\n";
	else if(x>=3)cout<<"16\n";
	else cout<<"32\n";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int __;cin>>__;
    while(__--){
    	solve();
	}
    return 0;
}