#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

// 模拟淘汰赛，返回中国队的最佳成绩
int knockout_stage(vector<int> &qualified, int china_team) {
    // 淘汰赛对阵顺序按照题目中给定的固定赛程
    vector<int> round16 = {0, 9, 4, 13, 8, 17, 12, 21, 1, 8, 5, 12, 9, 16, 13, 14};
    vector<int> next_round;
    
    // 16强赛
    for (int i = 0; i < 16; i += 2) {
        int winner = max(qualified[round16[i]], qualified[round16[i + 1]]);
        next_round.push_back(winner);
    }

    // 检查中国队是否晋级
    if (find(next_round.begin(), next_round.end(), china_team) == next_round.end()) return 16;

    vector<int> quarterfinals;
    // 8强赛
    for (int i = 0; i < 8; i += 2) {
        int winner = max(next_round[i], next_round[i + 1]);
        quarterfinals.push_back(winner);
    }

    // 检查中国队是否晋级
    if (find(quarterfinals.begin(), quarterfinals.end(), china_team) == quarterfinals.end()) return 8;

    vector<int> semifinals;
    // 4强赛
    for (int i = 0; i < 4; i += 2) {
        int winner = max(quarterfinals[i], quarterfinals[i + 1]);
        semifinals.push_back(winner);
    }

    // 检查中国队是否晋级
    if (find(semifinals.begin(), semifinals.end(), china_team) == semifinals.end()) return 4;

    // 决赛
    int final_winner = max(semifinals[0], semifinals[1]);
    if (final_winner == china_team) return 1;  // 中国队获得冠军
    return 2;  // 中国队在决赛中输掉
}

void solve() {
    vector<vector<int>> groups(8);
    int china_team;
    
    // 读取8组每组4个队伍，并按降序排序
    for (int i = 0; i < 8; ++i) {
        for (int j = 0; j < 4; ++j) {
            int team;
            cin >> team;
            groups[i].push_back(team);
            if (i == 0 && j == 0) china_team = team;  // 假设第一个队伍是中国队
        }
        sort(groups[i].rbegin(), groups[i].rend());  // 每组队伍按实力排序
    }

    vector<int> qualified;  // 存储晋级淘汰赛的队伍

    // 取每组前两名队伍晋级
    for (int i = 0; i < 8; ++i) {
        qualified.push_back(groups[i][0]);
        qualified.push_back(groups[i][1]);
    }

    // 如果中国队没有晋级淘汰赛，直接返回32
    if (find(qualified.begin(), qualified.end(), china_team) == qualified.end()) {
        cout << 32 << endl;
        return;
    }

    // 模拟淘汰赛，输出中国队的最佳成绩
    cout << knockout_stage(qualified, china_team) << endl;
}

int main() {
    int t;
    cin >> t;  // 测试用例的数量
    while (t--) {
        solve();
    }
    return 0;
}