#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
	int t;
	cin >> t;
	vector<int> a;
	while(t--)
	{
		int ca;
		a.clear();
		for(int i = 0;i < 32;i++)
		{
			int x;
			cin >> x;
			a.push_back(x);
		}
		ca = a[0];
		sort(a.rbegin(),a.rend());
		if(ca == a[0])
			cout << 1 << endl;
		else if(ca == a[1])
			cout << 2 << endl;
		else if(ca >= a[3])
			cout << 4 << endl;
		else if(ca >= a[7])
			cout << 8 << endl;
		else if(ca >=  a[15])
			cout << 16 << endl;
		else
			cout << 32 << endl;
			
	}
	return 0;
}