#include <iostream>
#include <array>
//#include <windef.h>
#include <algorithm>
#include <cstdlib>
#include <cassert>
#include <numeric>
#include <climits>
#include <vector>
#include <cmath>
#define ENDL endl
using i64=long long;
std::istream& CIN = std::cin;
std::ostream& COUT = std::cout;
using namespace std;

int main() {
    int tt;
    cin>>tt;
    int cnt = 0;
    int result[6] = {32,16,8,4,2,1};
    while(tt--){
        vector<pair<int,int>> arr(32);
        for(int i = 0;i<32;i++){
            cin>>arr[i].first;
            arr[i].second = i+1;
        }
        sort(arr.begin(),arr.end());
        int china = 0;
        for(int i = 0;i<32;i++){
            if(arr[i].second == 1){
                china = i+1;
                break;
            }
        }
        cout<<result[(int)std::__lg(china)]<<endl;
    }
    return 0;
}