// author:  jieda
// file:	cpp
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
# define fi first
# define se second
# define all(x) x.begin(),x.end()
# define stst stringstream
# define pb push_back
# define pf push_front
# define pp push
# define lowbit(x) (x)&(-x)
# define fa(i,op,n) for (ll i = op; i <= n; i++)
# define fb(j,op,n) for (ll j = op; j >= n; j--)
# define fg(i,op,n) for (ll i = op; i != n; i = ne[i])
int dx[4] = {-1,0,1,0},dy[4] = {0,1,0,-1};
typedef unsigned long long  ull;
typedef long long ll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
const ll N = 1e6+1e5+1e4,M = 1e5+10,INF = 0x3f3f3f3f,mod = 1e9+7;
const ll MOD = 212370440130137957ll;//hash(hight)
const int base = 131;
const double eps = 1e-3;
const int seed=10086,mo=1e6+7; //hash(lower)
int prime = 233317;

void solve(){	
	vector<int> a(32);
	fa(i,0,31) cin>>a[i];
	vector<int> p(32);iota(all(p),0);
	sort(all(p),[&](int x,int y){
		return a[x]>a[y];
	});
	int rnk;
	fa(i,0,31){
		if(p[i] == 0) rnk = i+1;
	}
	if(rnk == 1) cout<<1<<'\n';
	else if(rnk>=2&&rnk<=5) cout<<2<<'\n';
	else if(rnk>=6&&rnk<=19) cout<<4<<'\n';
	else if(rnk>=20&&rnk<=26) cout<<8<<'\n';
	else if(rnk>=27&&rnk<=30) cout<<16<<'\n';
	else if(rnk == 31||rnk == 32) cout<<32<<'\n';
	return ;
}	

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int t = 1;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}
/**/