#include<bits/stdc++.h>

using ll = long long;
using ull = unsigned long long;
using ari = std::array<int, 3>;
using PII = std::pair<int, int>;

const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-6;

int a[N],b[N];
void solve() {

    for(int i=1;i<=32;i++)
    {
        std::cin>>a[i];
        b[i]=a[i];
    }

    std::sort(a+1,a+1+32);
    ll cnt=0;

    int rk=0;
    for(int i=1;i<=32;i++)
    {
        if(b[i]==a[1]) rk=i;
    }
    if(rk==32){
        std::cout<<1<<'\n';
    }else {
        if(rk==31){
            std::cout<<2<<'\n';
        }else{
            if(rk>16) std::cout<<4<<'\n';
            else{
                if(rk>8) std::cout<<8<<'\n';
                else{
                    if(rk>2) std::cout<<16<<'\n';
                    else std::cout<<32<<'\n';
                }
            }
        }
    }
}

signed main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);

    int t = 1;
    std::cin>>t;
    while (t--) {
        solve();
    }

    return 0;
}