#include<bits/stdc++.h>

using namespace std;
const int N = 1e6 + 10;
int a[N]; 

int main(){
	int T;
	cin >> T;
	while(T--)
	{
		priority_queue <int>  q;
		int flagans;
		for(int i = 1; i <= 32; i++)
		{
			int t;
			cin >> t;
			if(i == 1) flagans = t;
			q.push(t);
		}
		
		for(int i = 1; i <= 32; i++)
		{
			int t = q.top(); q.pop();
			if(flagans == t)
			{
				if(i == 1)
				{
					cout << 1 << endl;
					break;
				}else if(i <= 2){
					cout << 2 << endl;
					break;
				}else if(i <= 4){
					cout << 4 << endl;
					break;
				}else if(i <= 8){
					cout << 8 << endl;
					break;
				}else if(i <= 16){
					cout << 16 << endl;
					break;
				}else{
					cout << 32 << endl;
					break;
				}
			}
		}
	}
}