import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int t;
    scan(t);

    while (t--) {
        int a, b, c;
        scan(a, b, c);
        auto ans = solve(a, b, c);
        writeln(ans);
    }
}

int solve(int a, int b, int c) {
    int res;

    foreach (comb ; 0 .. 1 << (1 << 3)) {
        auto x = new int[](3);

        foreach (i ; 0 .. 1 << 3) if (comb & 1 << i) {
            foreach (j ; 0 .. 3) if (i & 1 << j) {
                x[j]++;
            }
        }

        if (x[0] <= a && x[1] <= b && x[2] <= c) {
            chmax(res, comb.popcnt);
        }
    }

    res--;

    return res;
}












void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}
