// LUOGU_RID: 175894884
// LUOGU_RID: 175308511
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<math.h>
#include<queue>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<unordered_map>
#include<string>
#include<time.h>
#include<random>
#include<unordered_set>
#include<bitset>
#include<deque>

#define endl '\n'
#define int long long
#define uint unsigned long long
#define double long double
using namespace std;
const int N = 4e5 + 610;
const long long INF = 2e18;
long long P = 998244353;
uint P2 = 131;
double eps = 1e-9;
int qim(int a, int b) {
    int res = 1;
    while (b) {

        if (b & 1)res = (res * a) % P;
        b /= 2;
        a = (a * a) % P;
    }
    return res % P;
}
int gcd(int a, int b) {
    return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}
int ff[N], inf[N];
int C(int n, int m) {
    return ff[n] * inf[n - m] % P * inf[m] % P;
}
int A(int n, int m) {
    return ff[n] * inf[n - m] % P;
}
int aa[N];
inline void solve() {
    for (int i = 1;i <= 32;i++)cin >> aa[i];
    if (aa[1] == 1 || aa[1] == 2)cout << 32;
    else if (aa[1] >= 3 && aa[1] <= 6)cout << 16;
    else if (aa[1] >= 7 && aa[1] <= 13)cout << 8;
    else if (aa[1] >= 14 && aa[1] <= 27)cout << 4;
    else if (aa[1] >= 28 && aa[1] <= 31)cout << 2;
    else cout << 1;
    cout << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;t = 1;cin >> t;

    /*ff[0] = inf[0] = 1;
    for (int i = 1;i < N / 2;i++) {
        ff[i] = ff[i - 1] * i % P;
        inf[i] = qim(ff[i], P - 2);
    }*/

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

    return 0;
}