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.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;



import java.lang.Math;

public class Test {

	public static void main(String[] args) {
		
		Scanner s = new Scanner(System.in);
		
		int t=s.nextInt();
		
		for(int i=0;i<t;i++)
		{
			
			int a=s.nextInt();
			int b=s.nextInt();
			int c=s.nextInt();
			
			int a1=a;
			int b1=b;
			int c1=c;
			
			int a2=a;
			int b2=b;
			int c2=c;
			
			int ans=0;
			int ans1=0;
			int ans2=0;
			
			if(a>0)
			{
				ans++;
				a=a-1;
			}
			if(b>0)
			{
				ans++;
				b=b-1;
			}
			if(c>0)
			{
				ans++;
				c=c-1;
			}
			if(a>0&b>0)
			{
				ans++;
				a=a-1;
				b=b-1;
			}
			if(b>0&c>0)
			{
				ans++;
				b=b-1;
				c=c-1;
			}
			if(a>0&c>0)
			{
				ans++;
				c=c-1;
				a=a-1;
			}
			if(a>0&c>0&b>0)
			{
				ans++;
				c=c-1;
				a=a-1;
				b=b-1;
			}
			
			
			
			
			
			if(a1>0)
			{
				ans1++;
				a1=a1-1;
			}
			if(b1>0)
			{
				ans1++;
				b1=b1-1;
			}
			if(c1>0)
			{
				ans1++;
				c1=c1-1;
			}
			if(a1>0&c1>0)
			{
				ans1++;
				c1=c1-1;
				a1=a1-1;
			}
			if(a1>0&b1>0)
			{
				ans1++;
				a1=a1-1;
				b1=b1-1;
			}
			if(b1>0&c1>0)
			{
				ans1++;
				b1=b1-1;
				c1=c1-1;
			}
			
			if(a1>0&c1>0&b1>0)
			{
				ans1++;
				c1=c1-1;
				a1=a1-1;
				b1=b1-1;
			}
			
			
			
			
			
			if(a2>0)
			{
				ans2++;
				a2=a2-1;
			}
			if(b2>0)
			{
				ans2++;
				b2=b2-1;
			}
			if(c2>0)
			{
				ans2++;
				c2=c2-1;
			}
			if(b>0&c>0)
			{
				ans2++;
				b2=b2-1;
				c2=c2-1;
			}
			if(a>0&b>0)
			{
				ans2++;
				a2=a2-1;
				b2=b2-1;
			}
			
			if(a2>0&c2>0)
			{
				ans2++;
				c2=c2-1;
				a2=a2-1;
			}
			if(a2>0&c2>0&b2>0)
			{
				ans2++;
				c2=c2-1;
				a2=a2-1;
				b2=b2-1;
			}
			
			System.out.println(Math.max(ans1,Math.max(ans2, ans)));
		}
		
		
		
			
			
		
		
		
		
		}

}
