#include<algorithm>//sort
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<utility>//pair
#include<vector>
//#define int long long
using namespace std;
#define ll long long
void so()
{
	int a[33],s;
	for (int i = 1; i <= 32; i++)
	{
		cin >> a[i];
	}
	s = a[1];
	sort(a + 1, a + 33);
	int p;
	for (int i = 1; i <= 32; i++)
	{
		if (a[i] == s)
		{
			p = i;
			break;
		}
	}
	if (p == 1)
	{
		cout << 32 << endl;
	}
	else if (p <4)
	{
		cout << 16 << endl;
	}
	else if (p < 8)
	{
		cout << 8 << endl;
	}
	else if (p < 16)
	{
		cout << 4 << endl;
	}
	else if (p < 32)
	{
		cout << 2 << endl;
	}
	else
	{
		cout << 1 << endl;
	}
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		so();
	}
}