Tired of boring office work, Denis decided to open a fast food restaurant.

On the first day he made a portions of dumplings, b portions of cranberry juice and c pancakes with condensed milk.

The peculiarity of Denis's restaurant is the procedure of ordering food. For each visitor Denis himself chooses a set of dishes that this visitor will receive. When doing so, Denis is guided by the following rules:

  * every visitor should receive at least one dish (dumplings, cranberry juice, pancakes with condensed milk are all considered to be dishes); 
  * each visitor should receive no more than one portion of dumplings, no more than one portion of cranberry juice and no more than one pancake with condensed milk; 
  * all visitors should receive different sets of dishes. 



What is the maximum number of visitors Denis can feed?

Input

The first line contains an integer t (1 ≤ t ≤ 500) — the number of test cases to solve.

Each of the remaining t lines contains integers a, b and c (0 ≤ a, b, c ≤ 10) — the number of portions of dumplings, the number of portions of cranberry juice and the number of condensed milk pancakes Denis made.

Output

For each test case print a single integer — the maximum number of visitors Denis can feed.

Example

Input

7
1 2 1
0 0 0
9 1 7
2 2 3
2 3 2
3 2 2
4 4 4


Output

3
0
4
5
5
5
7

Note

In the first test case of the example, Denis can feed the first visitor with dumplings, give the second a portion of cranberry juice, and give the third visitor a portion of cranberry juice and a pancake with a condensed milk.

In the second test case of the example, the restaurant Denis is not very promising: he can serve no customers.

In the third test case of the example, Denise can serve four visitors. The first guest will receive a full lunch of dumplings, a portion of cranberry juice and a pancake with condensed milk. The second visitor will get only dumplings. The third guest will receive a pancake with condensed milk, and the fourth guest will receive a pancake and a portion of dumplings. Please note that Denis hasn't used all of the prepared products, but is unable to serve more visitors.


import java.util.Scanner;

/**
 * Created by zhangshichen on 2020/2/23.
 */
public class Contest622 {

    public static void main(String[] args) {
        FastFoodRestraurant();
    }

    private static void FastFoodRestraurant() {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();  // the number of test cases to solve
        for (int i = 0; i < t; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            int c = scanner.nextInt();
            System.out.println(solveA(a, b, c));
        }
        scanner.close();
    }

    private static int distribution(int a, int b, int c, int[][] patterns) {
        int visitors = 0;
        for (int[] pattern : patterns) {
            if (a >= pattern[0]
                    && b >= pattern[1]
                    && c >= pattern[2]) {
                a -= pattern[0];
                b -= pattern[1];
                c -= pattern[2];
                visitors++;
            }
        }
        return visitors;
    }

    private static int solveA(int a, int b, int c) {
        // only 7 patterns
        int[][] patterns1 = new int[][]{
                {1, 0, 0},
                {0, 1, 0},
                {0, 0, 1},
                {1, 0, 1},
                {1, 1, 0},
                {0, 1, 1},
                {1, 1, 1}
        };

        int[][] patterns2 = new int[][]{
                {1, 0, 0},
                {0, 1, 0},
                {0, 0, 1},
                {1, 1, 0},
                {0, 1, 1},
                {1, 0, 1},
                {1, 1, 1}
        };

        int[][] patterns3 = new int[][]{
                {1, 0, 0},
                {0, 1, 0},
                {0, 0, 1},
                {0, 1, 1},
                {1, 0, 1},
                {1, 1, 0},
                {1, 1, 1}
        };
        
        int visitors1 = distribution(a, b, c, patterns1);
        int visitors2 = distribution(a, b, c, patterns2);
        int visitors3 = distribution(a, b, c, patterns3);

        return Math.max(Math.max(visitors1, visitors2), visitors3);
    }
}
