#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 50;

//struct node
//{
//	ll t;
//	
//	bool operator< (const node &w) const
//	{
//		return t > w.t;
//	}
//}
ll a[N];
int n;

int main()
{
	cin >> n;
	
	while (n --)
	{
		cin >> a[0];
		ll res = a[0];
		int cnt = 0;
		
		for (int i = 1 ; i < 32 ; i ++) 
		{
			cin >> a[i];
			if (res > a[i]) cnt ++;
		}
		
		if (cnt == 31) cout << 1 << endl;
		else if (cnt < 2) cout << 32 << endl;
		else if (cnt < 3) cout << 16 << endl;
		else if (cnt < 4) cout << 8 << endl;
		else if (cnt < 5) cout << 4 << endl;
		else cout << 2 << endl;
	}
	
	return 0;
}