#include<iostream>
#include<map>
#include<algorithm>
#include<stack>
using namespace std;
typedef long long ll;
ll a[40];
int main()
{
	ll t;
	cin >> t;
	while (t--)
	{
		ll n = 32;
		for (ll i = 1; i <= n; i++)cin >> a[i];
		ll ans = a[1];
		sort(a + 1, a + 1 + n);
		for (ll i = 1; i <= 32; i++)
			if (ans == a[i])
			{
				ans = i;
				break;
			}
		if (ans == 1)cout << 32 << endl;
		else if (ans == n)cout << 1 << endl;
		else if (ans >= 2 && ans <= 3)cout << 16 << endl;
		else if (ans <= n - 1 && ans >= n - 2)cout << 2 << endl;
		else if (ans >= 4 && ans <= 4 + 13 - 1)cout << 4 << endl;
		else cout << 8 << endl;
	}
}