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.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
import java.util.stream.Collectors;

/**
 * <p></p>
 *
 * @author: xty
 * @create: 2020-02-23 13:32
 **/
public class Main {



    public static void main(String[] args) {
        int n;

        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        for(int i=1;i<=n;i++)
        {
            int a,b,c;
            int res = 0;
            a = scanner.nextInt();
            b = scanner.nextInt();
            c = scanner.nextInt();
            ArrayList<Integer> cc = new ArrayList();
            cc.add(a);
            cc.add(b);
            cc.add(c);
            Collections.sort(cc,Collections.reverseOrder());
            int[] num = new int[]{cc.get(0),cc.get(1),cc.get(2)};
       
            if(num[0]>=1)
            {
                num[0]--;
                res++;
            }
            if(num[1]>=1)
            {
                num[1]--;
                res++;
            }
            if(num[2]>=1)
            {
                num[2]--;
                res++;
            }

            if(num[0]>=1&&num[1]>=1)
            {
                num[0]--;
                num[1]--;
                res++;
            }
            if(num[0]>=1&&num[2]>=1)
            {
                num[0]--;
                num[2]--;
                res++;
            }
            if(num[1]>=1&&num[2]>=1)
            {
                num[1]--;
                num[2]--;
                res++;
            }
            if(num[0]>=1&&num[1]>=1&&num[2]>=1)
            {
                res++;
            }
            System.out.println(res);
        }
    }
}
