#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 7, mod = 1e9 + 7;
const int inf = 1LL << 30;
int n;
int a[40];
int c;
void solve() {
	for(int i=1; i<=32; ++i) {
		cin>>a[i];
	}
	c = a[1];
	sort(a+1,a+32+1);
	int id;
	for(int i=1; i<=32; ++i) {
		if(c==a[i]) id = i;
	}
	id-=1;
	if(id<2) cout<<"32";
	else if(id<7) cout<<"16";
	else if(id<13) cout<<"8";
	else if(id<25) cout<<"4";
	else if(id<31) cout<<"2";
	else if(id==31) cout<<"1";
}
int main() {
	int tc = 1;
	cin >> tc;
	while (tc--) {
		solve();
		if(tc!=0) cout<<endl;
	}
	return 0;
}