#include <bits/stdc++.h>
#define int long long
using namespace std;

void solve() {
    vector<vector<int>> q(8);
    int mark;

    // 读取每组的四个实力值
    for(int i = 0; i < 8; ++i) {
        vector<int> num(4);
        for(int j = 0; j < 4; ++j) {
            cin >> num[j];
            if (i == 0 && j == 0) mark = num[j];
        }
        sort(num.rbegin(), num.rend());
        q[i] = num;
    }

    // 保留每组的前两名
    vector<int> qq;
    bool foundMark = false;
    for(auto& group : q) {
        qq.push_back(group[0]);
        qq.push_back(group[1]);
    }

    // 检查中国队是否在淘汰赛阶段
    if(find(qq.begin(), qq.end(), mark) == qq.end()) {
        cout << 32 << endl;
        return;
    }

    vector<int> pp1(8), pp2(8);
    pp1 = {qq[0], qq[3], qq[4], qq[7], qq[8], qq[11], qq[12], qq[15]};
    pp2 = {qq[1], qq[2], qq[5], qq[6], qq[9], qq[10], qq[13], qq[14]};

    int round = 16;
    for(int i = 0; i < 2; ++i) {
        bool flag = false;
        vector<int> pp3, pp4;

        // 第一半区
        for(int j = 0; j < pp1.size(); j += 2) {
            int xx = max(pp1[j], pp1[j + 1]);
            if (xx == mark) flag = true;
            pp3.push_back(xx);
        }
        pp1 = pp3;

        // 第二半区
        for(int j = 0; j < pp2.size(); j += 2) {
            int xx = max(pp2[j], pp2[j + 1]);
            if (xx == mark) flag = true;
            pp4.push_back(xx);
        }
        pp2 = pp4;

        if (!flag) {
            cout << round << endl;
            return;
        }
        round /= 2;
    }

    int nn1 = max(pp1[0], pp1[1]);
    int nn2 = max(pp2[0], pp2[1]);

    if (nn1 != mark && nn2 != mark) {
        cout << 4 << endl;
        return;
    }

    nn1 = max(nn1, nn2);
    if (nn1 == mark) {
        cout << 1 << endl;
    } else {
        cout << 2 << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}