#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;

struct DSU{
    vector<int> f,siz;
    DSU(){}
    DSU(int n){
        init(n);
    }
    void init(int n){
        f.resize(n);
        iota(f.begin(),f.end(),0);
        siz.assign(n,1);
    }
    int find(int x){
        while(x != f[x]){
            x = f[x] = f[f[x]];
        }
        return x;
    }
    bool same(int x, int y){
        return find(x) == find(y);
    }
    bool merge(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) return false;
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    int size(int x){
        return siz[find(x)];
    }
};

ll gcd(ll a, ll b){
    a = abs(a), b = abs(b);
    ll tmp;
    while(b > 0){
        tmp = a % b;
        a = b;
        b = tmp;
    }
    return a;
}

ll power(ll a, ll b, int mod){
    a %= mod;
    ll res = 1;
    while(b > 0){
        if(b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

void solve(){
    vector<int> a(32);
    for(int i = 0; i < 32 ; i ++) cin >> a[i];
    int t = a[0];
    sort(a.begin(),a.end());
    int loc = 0;
    for(int i = 0; i < 32; i ++){
        if(a[i] == t){
            loc = i;
            break;
        }
    }
    loc ++;
    if(loc == 32){
        cout << 1 << '\n';
    }
    else if(loc >= 28){
        cout << 2 << '\n';
    }
    else if(loc >= 14){
        cout << 4 << '\n';
    }
    else if((loc >= 7)){
        cout << 8 << '\n';
    }
    else if(loc >= 3){
        cout << 16 << '\n';
    }
    else{
        cout << 32 << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while(_ --){
        solve();
    }
    return 0;
}