#include <bits/stdc++.h>
using namespace std;

int n,m;
struct pp
{
    int idx,w;
}a[35];
bool cmp(pp a,pp b)
{
    if(a.w!=b.w)
    {
        return a.w>b.w;
    }
    return a.idx<b.idx;
}
int main(){
    int t;
    cin>>t;
    int rank[33];
    while(t--)
    {
        for(int i=1;i<=32;i++)
        {
            cin>>a[i].w;
            a[i].idx=i;
        }
        sort(a+1,a+33,cmp);
        int x;
        int y;
        for(int i=1;i<=32;i++)
        {
            if(a[i].idx==1)
            {
                x=i;
                break;
            }
        }
        y=32-x;
        int be=x-1;
        int ans=32;
        if(be==0)
        {
            cout<<"1"<<endl;
            continue;
        }
        while(y&&be)
        {
            y=y/2;
            be=(be+1)/2;
            ans=ans/2;
        }
        cout<<ans<<endl;
    }
    return 0;
}