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

void solve() {
    vector<int> strengths(32);
    for (int i = 0; i < 32; ++i) {
        cin >> strengths[i];
    }

    // 中国队的实力
    int mark = strengths[0];
    
    // 小组赛阶段
    vector<int> group_winners(8), group_runners(8);
    for (int i = 0; i < 8; ++i) {
        vector<int> group = {strengths[i * 4], strengths[i * 4 + 1], strengths[i * 4 + 2], strengths[i * 4 + 3]};
        sort(group.rbegin(), group.rend());
        group_winners[i] = group[0];
        group_runners[i] = group[1];
    }

    // 检查中国队是否晋级
    bool advanced_to_knockouts = false;
    for (int i = 0; i < 8; ++i) {
        if (group_winners[i] == mark || group_runners[i] == mark) {
            advanced_to_knockouts = true;
            break;
        }
    }
    
    if (!advanced_to_knockouts) {
        cout << 32 << endl;
        return;
    }

    // 淘汰赛阶段
    vector<int> knockout_winners;
    for (int i = 0; i < 8; ++i) {
        if (i % 2 == 0) {
            knockout_winners.push_back(max(group_winners[i], group_runners[i / 2 + 1])); // A1 vs B2
        } else {
            knockout_winners.push_back(max(group_winners[i], group_runners[i / 2])); // B1 vs A2
        }
    }

    // 继续淘汰赛
    int round = 16;
    for (int i = 0; i < 3; ++i) {
        bool mark_in_this_round = false;
        vector<int> next_round_winners;

        for (int j = 0; j < knockout_winners.size(); j += 2) {
            int winner = max(knockout_winners[j], knockout_winners[j + 1]);
            if (winner == mark) mark_in_this_round = true;
            next_round_winners.push_back(winner);
        }
        knockout_winners = next_round_winners;

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

    // 最后两支队伍的比较
    int final1 = max(knockout_winners[0], knockout_winners[1]);
    
    if (final1 == 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;
}