#include<bits/stdc++.h>
#define integer long long int
#define endl '\n'

inline void solve();
inline bool cmp(integer x, integer y);

const int N = 1e6 + 10;
const int MOD = 998244353;
const int INF = 0x7FFFFFFF;

signed main() {
	std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr);
	int T = 1; 
	std::cin >> T; 
	while (T--) solve(); 
	return 0;
}

inline int lowbit(int x) {
	return (x & (-x));
}

integer n;

inline void solve() {
	std::vector<integer>arr(40, 0);
	for (int i = 1; i <= 32; i ++) {
		integer temp; std::cin >> temp; arr.push_back(temp);
	}
	int cnt = 1;
	for (int i = 1; i < 32; i++) {
		if (arr[i] > arr[0]) cnt++;
	}
	if (cnt == 1) std::cout << 1 << endl;
	else if (cnt <= 5) std::cout << 2 << endl;
	else if (cnt <= 19) std::cout << 4 << endl;
	else if (cnt <= 26) std::cout << 8 << endl;
	else if (cnt <= 30) std::cout << 16 << endl;
	else std::cout << 32 << endl;
	// std::sort(arr.begin(), arr.end(), cmp);
	return;
}

// inline bool cmp(int x, D y) {
	// if (x.sl <= y.sl) return false;
	// else return true;
// }