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



public class codeforce {
	public static void main(String[] args)throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		while(t-->0) {
			String s = br.readLine();
			String[] ss = s.trim().split(" ");
			int a = Integer.parseInt(ss[0]);
			int b = Integer.parseInt(ss[1]);
			int c = Integer.parseInt(ss[2]);
			int serve = 0;
			if(a!=0) {
				serve += 1;
				a -= 1;
			}
			if(b!=0) {
				serve += 1;
				b -= 1;
			}
			if(c!=0) {
				serve += 1;
				c -= 1;
			}
			int ab = 0;
			int bc = 0;
			int ac = 0;
			if(b>a && b>c) {
				if(a!=0 && b!=0) {
					serve += 1;
					a -= 1;
					b -=1;
					ab = 1;
				}
				if(b!=0 && c!=0) {
					serve += 1;
					c -= 1;
					b -=1;
					bc = 1;
				}
			}
			if(c>a && c>b) {
				if(b!=0 && c!=0 && bc==0) {
					serve += 1;
					c -= 1;
					b -=1;
					bc = 1;
				}
				if(a!=0 && c!=0) {
					serve += 1;
					a -= 1;
					c -=1;
					ac = 1;
				}
			}
			if(a!=0 && b!=0 && ab==0) {
				serve += 1;
				a -= 1;
				b -=1;
				ab = 1;
			}
			if(b!=0 && c!=0 && bc==0) {
				serve += 1;
				c -= 1;
				b -=1;
				bc = 1;
			}
			if(a!=0 && c!=0 && ac ==0) {
				serve += 1;
				a -= 1;
				c -=1;
				ac= 1;
			}
			if(a!=0 && b!=0 && c!=0) {
				serve += 1;
				a-=1;
				b-=1;
				c-=1;
			}


			System.out.println(serve);
			
			
		}
	}
}
