#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 32;

void solve() {

    std::vector<std::pair<int, int>> a(N);
    for (int i = 0; i < N; i++) {
        std::cin >> a[i].first;
        a[i].second = i;
    }

    std::sort(begin(a), end(a), std::greater<>());
    int k = 0;
    for (int i = 0; i < N; i++) {
        if (a[i].second == 0) {
            k = 0;
        }
    }

    int ans = 0;
    if (k == 0) {
        ans = 1;
    } else if (k <= 4) {
        ans = 2;
    } else if (k <= 4 + 14) {
        ans = 4;

    } else if (k <= 4 + 14 + 7) {
        ans = 8;
    } else if (k <= 4 + 14 + 7 + 4) {
        ans = 16;
    } else {
        ans = 32;
    }

    std::cout << ans << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}