#include<bits/stdc++.h> 
#define lson p<<1
#define rson p<<1|1
#define int	long long
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ANS cout<<ans<<"\n";
#define forn for(int i=1;i<=n;i++)
#define form for(int i=1;i<=m;i++)
#define forq for(int i=1;i<=q;i++)
#define fornj for(int j=1;j<=n;j++)
#define formj for(int j=1;j<=m;j++)
#define forqj for(int j=1;j<=q;j++)
#define fornn for(int i=n;i>=1;i--)
#define formm for(int i=m;i>=1;i--)
#define forqq for(int i=q;i>=1;i--)
using namespace std;
const int nnu=2e5+10;
const int mod=1e9+7;
const double eps = 1e-5;
int qpow(int a,int m){
	if(a==0)return 0;
	int s=1;
	while(m){
		if(m&1) s=(s*a)%mod;
		m>>=1;a=(a*a)%mod;
	}
	return s;
}
int prime[nnu],cntPrime=0;
bool meoPrime[nnu];
bool judgePrime(int x){
	if(x==1)return false ;
	for(int i=2;i*i<=x;i++){
		if(x%i==0)return false;
	}
	return true;
}
void initPrime(){
	int maxn=1e5;
	for(int i=2;i<=maxn;i++){
		if(meoPrime[i]==0)prime[++cntPrime]=i;
		for(int j=1;j<=cntPrime&&prime[j]*i<=maxn;j++){
			meoPrime[prime[j]*i]=1;
			if(i%prime[j]==0)break;
		}
	} 
} 
void add(int &t,int a){
	t=(t%mod+a%mod+mod)%mod;
}
int dx[]={0,0,0,-1,1};
int dy[]={0,1,-1,0,0};
int tt=1,ttt=1;
int n,q,m,k;
int ans=0;
int arr[nnu],brr[nnu],f[nnu],g[nnu];

int C(int n,int m){
	return f[n]*g[n-m]%mod*g[m]%mod;
}
void initC(){
	f[0]=g[0]=1;
	int maxn=2e5;
	for(int i=1;i<=maxn;i++){
		f[i]=(f[i-1]*i)%mod;
		g[i]=(g[i-1]*qpow(i,mod-2))%mod;
	}
}

void solve(){
	//wipe data
	ans=0;
	//solve
	n=32;
	forn {
		cin>>arr[i];
		if(i>=2&&arr[i]<arr[1])ans++;
	}
	if(ans>=31)cout<<"1\n";
	else if(ans>=27)cout<<"2\n";
	else if(ans>=13)cout<<"4\n";
	else if(ans>=6)cout<<"8\n";
	else if(ans>=2)cout<<"16\n";
	else cout<<"32\n";
	
}
signed main(void)
{
	ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);

	cin>>ttt;
	for(tt=1;tt<=ttt;tt++)solve();return 0;
}