#include<bits/stdc++.h>
#define int long long
#define For(i,l,r) for(int i=l;i<=r;++i)
#define foR(i,r,l) for(int i=r;i>=l;--i)
#define meme(a,b) memset(a,b,sizeof(a,b))
using namespace std;
const int N = 110;
const int mod = 1e18;
struct mt
{
	int th;
	int id;	
};
bool cmp(mt a,mt b){
	return a.th>b.th;
}
void solve(){
	int n=32;
	std::vector<mt> v(n);
	For(i,0,n-1){
		v[i].id=i+1;
		cin>>v[i].th;
	}
	sort(v.begin(),v.end(),cmp);
	int rk=0;
	For(i,0,n-1){
		if(v[i].id==1){
			rk=i+1;
		}
	}
	if(rk+2>32){//16强 2个 31
		cout<<"32\n";
	}else if(rk+6>32){//8强 2+2+2！
		cout<<"16\n";
	}else if(rk+7>32){//4强 
		cout<<"8\n";
	}else if(rk+29>32){//13 13 1 
		cout<<"4\n";
	}else if(rk<=3&&rk!=1){
		cout<<"2\n";
	}
	else{
		cout<<"1\n";
	}

}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;cin >> t;
	while (t--) {
	solve();
	}
	return 0;
}