#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstring>
#include<ctime>
#include<random>
#include<deque>
#include<map>
#include<stack>
#include<set>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define lowbit(x) (x & (-x))
const int xy[][2] = { 0,1, 0, -1, 1, 0, -1, 0 };
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<char, char> PCC;
#define x first
#define y second
inline int read();
const int INF = 0x3f3f3f3f, N = 1e5 + 10, MOD = 1e9 + 7, K = 131;
vector<int>a(34), p[9];
int cn = 0;
bool _32() {
    return p[1][0] != cn && p[1][1] != cn;
}
bool _16() {
    if (p[1][2] == cn) {
        return cn > p[2][3];
    }
    else {
        return cn > p[2][2];
    }
}
bool _8() {
    if (p[1][3] == cn) {
        return cn > max(p[3][3], p[4][2]);
    }
    else {
        return cn > max(p[4][3], p[3][2]);
    }
}
bool _4() {
    if (p[1][3] == cn) {
        return cn > max({ p[5][3], p[6][2], p[7][3], p[8][2] });
    }
    else {
        return cn > max({ p[5][2], p[6][3], p[7][2], p[8][3] });
    }
}
void solve() {
    cn = 0;
    bool f = 1;
    for (int i = 1; i <= 8; i++)p[i].clear();
    for (int i = 1; i <= 32; i++) {
        cin >> a[i];
        if (!cn)cn = a[i];
        else if (cn < a[i])f = 0;
        p[i / 4 + i % 4 != 0].pb(a[i]);
        if (i % 4 == 0)sort(all(p[i / 4]));
    }
    if (f)return cout << "1\n", void();
    if (!_32())cout << "32\n";
    else if (!_16())cout << "16\n";
    else if (!_8())cout << "8\n";
    else if (!_4())cout << "4\n";
    else cout << "2\n";
}
signed main() {
    IOS;
    int _ = 1;
    cin >> _;
    while (_--)solve();
    return 0;
}
inline int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }
    return x * f;
}