#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<time.h>
#include<random>
#include<queue>
#include<map>
#include<array>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<stack>
#include<bitset>
#include<numeric>
#define test printf("ans: ");
#define pd(x) puts(x ? "Yes" : "No")
#define db(x) cerr << #x << " : " << x << '\n'
#define endl "\n"
using namespace std;
typedef unsigned long long ULL;
typedef long long LL;
mt19937_64 rnd(time(0));
typedef pair<int, int>PII;
const int N = 200010, M = 2*N, INF = 0x3f3f3f3f, mod = 1e9 + 7;

void solve()
{
	vector<int>a(33);
	for(int i = 1;i <= 32;i++)cin>>a[i];
	int val = a[1];
	int idx = 0;
	sort(a.begin() + 1,a.end());
	for(int i = 1;i <= 32;i++)
	{
		if(a[i] == val)
		{
			idx = i;break;
		}
	}

	//有几个比他弱
	idx--;

	if(idx >= 31)cout << 1 << endl;
	else if(idx >= 28)cout << 2 << endl;
	else if(idx >= 13)cout << 4 << endl;
	else if(idx >= 6)cout << 8 << endl;
	else if(idx >= 2)cout << 16 << endl;
	else cout << 32 << endl;

}

void Init()
{

}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

	Init();
	int T = 1;
	cin >> T;
	while (T--)
		solve();

	return 0;
}


/*
1.LL
2.边界情况
3.初始化(数组复用/是否读完了数据)
4.数组越界
5.数据类型
6.变量名是否重复(尤其是写循环的时候)
7.输入输出
8.读题目
9.读代码
10.对拍
*/