#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define rep(i,x,y) for(ll i=x;i<=y;++i)
#define per(i,x,y) for(ll i=x;i>=y;--i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll a[50],n;
inline ll in()
{
    ll res=0,f=1;
    char ch;
    while((ch=getchar())<'0'||ch>'9')
     if(ch=='-') f=-1;
    res=res*10+ch-'0';
    while((ch=getchar())>='0'&&ch<='9')
     res=res*10+ch-'0';
    return res*f;
}
inline void put(ll x)
{
    if(x<0) putchar('-'),x*=-1;
    if(x>9) put(x/10);
    putchar(x%10+48);
}
int main()
{
    n=in();
    rep(i,1,n)
    {
    	ll rank=0;
    	rep(j,1,32)
    	{
    		a[j]=in();
    		if(j>1)
    		 if(a[j]>a[1])
    		  ++rank;
		}
		++rank;
		if(rank==1) printf("1\n");
		else if(rank>=2&&rank<=5) printf("2\n");
		else if(rank>=6&&rank<=19) printf("4\n");
		else if(rank>=20&&rank<=26) printf("8\n");
		else if(rank>=27&&rank<=29) printf("16\n");
		else printf("32\n") ;
	}
    return 0;
}