#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstring>
#include<ctime>
#include<random>
#include<deque>
#include<map>
#include<stack>
#include<set>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define lowbit(x) (x & (-x))
const int xy[][2] = { 0,1, 0, -1, 1, 0, -1, 0 };
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<char, char> PCC;
#define x first
#define y second
inline int read();
const int INF = 0x3f3f3f3f, N = 1e5 + 10, MOD = 1e9 + 7, K = 131;
void solve() {
    int me, rk = 1; cin >> me;
    for (int i = 1; i < 32; i++) {
        int x; cin >> x;
        if (x > me)rk++;
    }
    if (rk == 1)cout << "1\n";
    else if (rk <= 5)cout << "2\n";
    else if (rk <= 19)cout << "4";
    else if (rk <= 26)cout << "8\n";
    else if (rk <= 30)cout << "16\n";
    else cout << "32\n";
}
signed main() {
    IOS;
    int _ = 1;
    cin >> _;
    while (_--)solve();
    return 0;
}
inline int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }
    return x * f;
}