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.io.*;
import java.util.*;


public class Main {
    static int a,b,c;
    private static List<String> permutations = new ArrayList<>();
        public static void main(String[] args) {
        PrintWriter writer = new PrintWriter(new BufferedOutputStream(System.out));
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer stringTokenizer;
            getAllPossiblePermutations("",0);
        try {
            int testCases = Integer.parseInt(bufferedReader.readLine());
            while (testCases--!=0) {
                stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                a=Integer.parseInt(stringTokenizer.nextToken());
                b=Integer.parseInt(stringTokenizer.nextToken());
                c=Integer.parseInt(stringTokenizer.nextToken());
                writer.println(solve(0,0,0,0,0));
            }
            writer.flush();
            writer.close();

        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    private static void getAllPossiblePermutations(String temp , int n) {
            if(n==3){
                if(!temp.equals("000"))permutations.add(temp);
            }
            else {
                getAllPossiblePermutations(temp+"1",n+1);
                getAllPossiblePermutations(temp+"0",n+1);
            }
    }
    private static int solve(int usedA ,int usedB , int usedC,int result, int n) {
            if(permutations.size()==n){
                if(usedA<=a && usedB<=b && usedC<=c) return result;
                else return 0;
            }
            String temp = permutations.get(n);
            return Math.max(solve(Integer.parseInt(String.valueOf(temp.charAt(0)))+usedA,Integer.parseInt(String.valueOf(temp.charAt(1)))+usedB
                    ,Integer.parseInt(String.valueOf(temp.charAt(2)))+usedC
            ,result+1,n+1),solve(usedA,usedB,usedC,result,n+1));
    }

}