#include<iostream>
#include <algorithm>

using namespace std;
//贪心法,先安排最多的

int main() {
    int n;
    cin >> n;
    int zushu[n];
    for (int i = 0; i < n; ++i) {
        int result = 0;
        int col[3];
        cin >> col[0] >> col[1] >> col[2];
        //从小到大排好顺序
        sort(col, col + 3);
        while ((col[0] + col[1] + col[2]) >= 3 && col[1] != 0 && col[0] >= 0) {
            if (col[2] >= 2) {
                col[2] -= 2;
                col[1] -= 1;
                result += 1;
                sort(col, col + 3);
                continue;
            }
            if (col[0] == 1 && col[1] == 1 && col[2] == 1) {
                result += 1;
                col[0] = 0;
                col[1] = 0;
                col[2] = 0;

            }

        }
        zushu[i] = result;
    }


    for (int m = 0; m < n; ++m) {
        cout << zushu[m] << endl;
    }

}