#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fi first
#define se second
#define mp make_pair

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
	int f = 1; x = 0; char s = getchar();
	while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
	while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
	x *= f;
}

const int N = 33;

int n, a[N];

int ask(int x) {
	if (x <= 2) return 32;
	//if (x <= 6) return 16;
	if (x <= 6) return 16;
	//if (x <= 14) return 8;
	if (x <= 13) return 8;
	// 30 ~ 31
	if (x <= 27) return 4;
	if (x <= 31) return 2;
	return 1;
}

int main() {
	int T; read(T);
	while (T--) {
		n = 32;
		for (int i = 1; i <= n; i++) read(a[i]);
		int p = 0, v = a[1];
		sort(a + 1, a + 1 + n);
		for (int i = 1; i <= n; i++) {
			if (v == a[i]) p = i;
		}
		printf("%d\n", ask(p));
	}
}