#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int mx,ans[1111],a[1111];
int pc[1111],qc[1111];
VI pl[1111];
void dfs(int gr,int gq,int lq) {
	if (gq<0||lq<0) return;
	//printf("? %d %d %d\n",gr,gq,lq);
	if (gr==8) {
		//assert(gq==0&&lq==0);
		rep(i,0,8) {
			sort(all(pl[i]),greater<int>());
			//rep(j,0,4) printf("%d",pl[i][j]); printf(" ");
		}
		//puts("");
		rep(i,0,4) pc[i*2]=pl[i*2][0],pc[i*2+1]=pl[i*2+1][1];
		rep(i,0,4) pc[i*2+8]=pl[i*2][1],pc[i*2+9]=pl[i*2+1][0];
		//rep(i,0,16) printf("%d ",pc[i]); puts("");
		int ret=32;
		per(i,0,5) {
			rep(j,0,(1<<i)) if (pc[j]==1) ret=(1<<i);
			if (i>0) {
				rep(j,0,(1<<(i-1))) qc[j]=max(pc[j*2],pc[j*2+1]);
				rep(j,0,(1<<(i-1))) pc[j]=qc[j];
				//rep(j,0,(1<<(i-1))) printf("%d ",pc[j]); puts("");
			}
		}
		mx=min(mx,ret);
	} else {
		int sz=gr==0?3:4;
		for (int gp=0;gp<=sz;gp++) {
			pl[gr].clear();
			if (gr==0) pl[gr].pb(1);
			rep(i,0,gp) pl[gr].pb(2);
			rep(i,0,sz-gp) pl[gr].pb(0);

			assert(SZ(pl[gr])==4);

			dfs(gr+1,gq-gp,lq-(sz-gp));
		}
	}
}
void solve(int rk) {
	mx=32;
	dfs(0,rk,31-rk);
	ans[rk]=mx;
	//printf("%d %d\n",rk,mx);
}
void precalc() {
	//solve(26);
	//return;
	rep(i,0,32) {
		solve(i);
	}
}

void solve() {
	rep(i,0,32) scanf("%d",&a[i]);
	int gq=0;
	rep(i,1,32) gq+=a[i]>a[0];
	printf("%d\n",ans[gq]);
}
int _;
int main() {
	precalc();
	for (scanf("%d",&_);_;_--) {
		solve();
	}
}