#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
#pragma GCC optimize(2)
#define int long long
#define debug(a) cout<<#a<<'='<<a<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repp(i,a,b) for(int i=a ;i<=b;i++)
#define per(i,b,a) for(int i=b;i>a;i--)
#define perr(i,b,a) for(int i=b;i>=a;i--)
#define pii pair<int,int>
#define mm memset
#define endl '\n'
#define xx frist
#define yy second
#define pb push_back
#define INF 0x7fffffff
pair<int ,int> a[N];
void slove()
{
	for(int i = 1 ; i <= 32 ; ++ i)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a + 1, a + 32 + 1);
	int p;
	for(int i = 1 ; i <= 32 ; ++ i)
	{
		if(a[i].second == 1)
		p = i;
	}
	p = 32 - p + 1;
	if(p > 30)
	{
		cout << 32 << endl;
	}
	else if(p > 26)
	{
		cout << 16 << endl;
	}
	else if(p > 19)
	{
		cout << 8 << endl;
	}
	else if(p > 5)
	{
		cout<< 4 << endl;
	}
	else if(p > 1)
	{
		cout << 2 << endl;
	}
	else cout << p << endl;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0) , cout.tie(0);
	int t = 1;
	cin >> t;
	while(t --)
	{
		slove();
	}
}