#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, a + N, std::greater());

    if (x == a[N - 1] || x == a[N - 2]) {
        std::cout << "32\n";
        return;
    }

    int p = std::find(a, a + N, x) - a;
    if (p == 0) {
        std::cout << 1 << "\n";
    } else {
        std::cout << (2 << (std::__lg(p))) << "\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;
}