#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
    int v[40];
    int ct;
    for(int i=1;i<=32;i++)
    {
    	cin>>v[i];
    }
    ct=v[1];

    sort(v+1,v+33,greater<int>());

    int js=0;
    for(int i=1;i<=32;i++)
    {
    	js++;
    	if(v[i]==ct) break;
    }

    if(js==1)
    {
    	cout<<1<<endl;
    }
    else if(js<=2)
    {
    	cout<<2<<endl;
    }
    else if(js<=19)//-17
    {
    	cout<<4<<endl;
    }
    else if(js<=26)//-7
    {
    	cout<<8<<endl;
    }
    else if(js<=30)//-2
    {
    	cout<<16<<endl;
    }
    else cout<<32<<endl;
}
/*

14 1 2 3 4 5 6 7 8 9 10 11 12 13 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

32-17=15

2  4
7c 8
11 12
15 16
19 20
23 24
27 28
31 32


*/
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}