#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()

using namespace std ;

const int inf = 0x3f3f3f3f ;
const int LLinf = 0x3f3f3f3f3f3f3f3f ;


void solve()
{
	std::vector<int> a(32);
	for(auto & p : a) cin >> p ;
	sort(a.begin() + 1 , a.end()) ;
	int it = upper_bound(a.begin() + 1 , a.end() , a[0]) - a.begin() - 1 ;
	if ( it <= 2 ) {
		cout << 32 << '\n' ;
	} else if ( it <= 5 ) {
		cout << 16 << '\n' ;
	} else if ( it <= 12 ) {
		cout << 8 << '\n' ;
	} else if ( it <= 26 ) {
		cout << 4 << '\n' ;
	} else if ( it <= 30 ) {
		cout << 2 << '\n' ;
	} else if ( it <= 31 ) {
		cout << 1 << '\n' ;
	}
}

signed main()
{
	cin.tie(nullptr)->ios::sync_with_stdio(false) ;

	int t = 1 ;
	cin >> t ;

	for(int i = 1 ; i <= t ; i++)
	{
		// cout << "case #" << i << " : " << '\n' ;
		solve() ; 
	}
	return 0 ; 
}