#include <bits/stdc++.h>

namespace stdv = std::views;
namespace stdr = std::ranges;

using i64 = long long;

template<typename A, typename B>
constexpr bool chmax(A& a, const B& b) {
    a = (a > b) ? a : b;
    return a == b;
}
template<typename A, typename B>
constexpr bool chmin(A& a, const B& b) {
    a = (a < b) ? a : b;
    return a == b;
}

constexpr int N = 32;
int a[N];

void Find() {
    for (int i = 0; i < N; i++) {
        std::cin >> a[i];
    }
    int x = a[0];
    std::sort(a + 1, a + N);
    for (int i = 0; i < N; i += 4) {
        std::sort(a + i, a + i + 4, std::greater());
    }

    if (a[0] != x && a[1] != x) {
        std::cout << "32\n";
        return;
    }

    std::vector<int> b;
    for (int i = 0; i < N; i += 8) {
        b.push_back(std::max(a[i], a[i + 5]));
    }
    for (int i = 1; i < N; i += 8) {
        b.push_back(std::max(a[i], a[i + 3]));
    }

    if (std::find(b.begin(), b.end(), x) == b.end()) {
        std::cout << 16 << "\n";
        return;
    }

    int ans = 8;
    while (ans > 1) {
        std::vector<int> nb;
        for (int i = 0; i < b.size(); i += 2) {
            nb.push_back(std::max(b[i], b[i + 1]));
        }
        b = std::move(nb);
        if (std::find(b.begin(), b.end(), x) == b.end()) {
            std::cout << ans << "\n";
            return;
        }
        ans /= 2;
    }

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

int main(int argc, const char* argv[]) {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;
    
    while (t--) {
        Find();
    }
    
    return 0;
}