#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int solve() {
    vector<int> a(32);
    for (auto &i : a) cin >> i;
    int c = a[0];
    sort(a.begin(), a.end());
    int pos = lower_bound(a.begin(), a.end(), c) - a.begin();
    if (pos < 2) return 32;
    if (pos < 6) return 16;
    if (pos < 13) return 8;
    if (pos < 28) return 4;
    if (pos < 31) return 2;
    return 1;
}

int main() {
    int t; cin >> t;
    while (t--) {
        cout << solve() << endl;
    }
    return 0;
}