#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<array>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef double db;
typedef pair<int,int> P;
#define fi first
#define se second
#define pb push_back
#define dbg(x) cerr<<(#x)<<":"<<x<<" ";
#define dbg2(x) cerr<<(#x)<<":"<<x<<endl;
#define SZ(a) (int)(a.size())
#define sci(a) scanf("%d",&(a))
#define pt(a) printf("%d",a);
#define pte(a) printf("%d\n",a)
#define ptlle(a) printf("%lld\n",a)
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
int t,v,a[35];
int main(){
    sci(t);
    while(t--){
        rep(i,1,32)sci(a[i]);
        v=a[1];
        sort(a+1,a+33);
        int p=-1;
        rep(i,1,32){
            if(a[i]==v){
                p=i-1;
                break;
            }
        }
        if(p<2)puts("32");
        else if(p<6)puts("16");
        else if(p<14)puts("8");
        else if(p<30)puts("4");
        else if(p<31)puts("2");
        else puts("1");
    }
    return 0;
}