#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int simulateTournament(vector<int>& strengths) {
    // 1. Sort teams by strength (descending)
    sort(strengths.begin(), strengths.end(), greater<int>());

    // 2. Group Stage Arrangement
    vector<vector<int>> groups(8, vector<int>(4));
    groups[0] = {strengths[0], strengths[31], strengths[30], strengths[29]}; // Chinese team with weakest

    int strengthIndex = 1;
    for (int i = 1; i < 8; ++i) {
        for (int j = 0; j < 4; ++j) {
            groups[i][j] = strengths[strengthIndex++];
        }
    }

    // 3. Simulate Knockout Stage
    vector<int> roundOf16;
    for (int i = 0; i < 8; ++i) {
        // Find the top two teams in each group
        sort(groups[i].begin(), groups[i].end(), greater<int>());
        roundOf16.push_back(groups[i][0]); 
        roundOf16.push_back(groups[i][1]);
    }

    // Predefined Round of 16 matches
    vector<pair<int, int>> matches = {
        {0, 9}, {8, 1}, {2, 11}, {10, 3}, {4, 13}, {12, 5}, {6, 15}, {14, 7}
    };

    vector<int> quarterFinals;
    for (auto& match : matches) {
        quarterFinals.push_back(max(roundOf16[match.first], roundOf16[match.second]));
    }

    vector<int> semiFinals;
    for (int i = 0; i < 4; ++i) {
        semiFinals.push_back(max(quarterFinals[2 * i], quarterFinals[2 * i + 1]));
    }

    int finalist1 = max(semiFinals[0], semiFinals[1]);
    int finalist2 = max(semiFinals[2], semiFinals[3]);

    int champion = max(finalist1, finalist2);

    // 4. Determine Chinese team's result
    if (champion == strengths[0]) return 1; // Champion
    if (finalist1 == strengths[0] || finalist2 == strengths[0]) return 2; // Finalist
    if (find(semiFinals.begin(), semiFinals.end(), strengths[0]) != semiFinals.end()) return 4; // Semi-finalist
    if (find(quarterFinals.begin(), quarterFinals.end(), strengths[0]) != quarterFinals.end()) return 8; // Quarter-finalist
    if (find(roundOf16.begin(), roundOf16.end(), strengths[0]) != roundOf16.end()) return 16; // Round of 16
    return 32; // Didn't advance
}

int main() {
    int t;
    cin >> t;

    while (t--) {
        vector<int> strengths(32);
        for (int i = 0; i < 32; ++i) {
            cin >> strengths[i];
        }

        int result = simulateTournament(strengths);
        cout << result << endl;
    }

    return 0;
}