#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define endl '\n'
#define pii pair<int, int>
#define ar2 array<int, 2>
#define ar3 array<int, 3>
#define ve vector
#define vc vector<int>
#define pb push_back
#define pf push_front
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
// int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
// int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int llinf = 0x3f3f3f3f3f3f3f3f;
const int inf = 1e9;
const int N = 5e5 + 5;
int mod = 1e9 + 7;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int n, m, k;
void solve()
{
    vc a(33);
    for (int i = 1; i <= 32; i++)
    {
        cin >> a[i];
    }
    int fl = a[1];
    sort(a.begin() + 1, a.end());
    auto it = lower_bound(a.begin() + 1, a.end(), fl) - a.begin();
    if (it == 32)
    {
        cout << 1 << endl;
    }
    else if (it < 32 && it >= 28)
    {
        cout << 2 << endl;
    }
    else if (it < 28 && it >= 24)
    {
        cout << 4 << endl;
    }
    else if (it >= 20 && it < 24)
    {
        cout << 8 << endl;
    }
    else if (16 <= it && it < 20)
    {
        cout << 16 << endl;
    }
    else
    {
        cout << 32 << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    for (int i = 1; i <= _; i++)
    {
        solve();
    }
    return 0;
}