#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(int x, int y)
{
    return x > y;
}
int main()
{
    int _;
    cin >> _;
    while(_--)
    {
        int a[35];
        for(int i = 1; i <= 32; i++)
            cin >> a[i];
        int t = a[1];
        sort(a + 1, a + 32 + 1, cmp);
        int rank = 0;
        for(int i = 1; i <= 32; i++)
        {
            if(t == a[i])
            {
                rank = i;
                break;
            }
        }
        if(rank == 1)
            cout << 1 << endl;
        else if(rank <= 17)
            cout << 2 << endl;
        else if(rank <= 25)
            cout << 4 << endl;
        else if(rank <= 26)
            cout << 8 << endl;
        else if(rank <= 30)
            cout << 16 << endl;
        else
            cout << 32 << endl;
    }
    return 0;
}