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.*;
import java.io.*;
/**
 * Submission for codeforces
 * @author abhinandanchandhok
 *
 */
public class Skeleton {
	public static void main(String agrs[])
	{
		Scanner sc = new Scanner(System.in);
	    //int t = sc.nextInt();
		//for(int i = 0; i < t; i++)
		//{
			int n = sc.nextInt();
			//int m = sc.nextInt();
			int a[]=new int[n];
			int b[]=new int[n];
			int c[]=new int[n];
			for(int j=0;j<n;j++)
			{
				a[j]=sc.nextInt();
				
				b[j]=sc.nextInt();
				c[j]=sc.nextInt();
				
			}
			
			for(int i=0;i<n;i++)
			{
				 long sum=0;
				
				if(a[i]>0)
				{
					sum++;
					a[i]=a[i]-1;
				}
				if(b[i]>0)
				{
					sum++;
					b[i]=b[i]-1;
				}
				if(c[i]>0)
				{
					sum++;
					c[i]=c[i]-1;
				}
				
				if(a[i]> b[i] && a[i]>c[i])
				{
					if(count(a[i],b[i])==1)
					{
						sum++;
						a[i]=a[i]-1;
						b[i]=b[i]-1;
					}
					if(count(a[i],c[i])==1)
					{
						sum++;
						a[i]=a[i]-1;
						c[i]=c[i]-1;
					}
					if(count(b[i],c[i])==1)
					{
						sum++;
						b[i]=b[i]-1;
						c[i]=c[i]-1;
					}
				
					
				}
				else if(b[i]>c[i])
				{
					if(count(b[i],c[i])==1)
					{sum+=1;
					b[i]=b[i]-1;
					c[i]=c[i]-1;
					}
					if(count(b[i],a[i])==1)
					{sum+=1;
					b[i]=b[i]-1;
					a[i]=a[i]-1;
					}
					
					if(count(a[i],c[i])==1)
					{
						sum++;
						a[i]=a[i]-1;
						c[i]=c[i]-1;
					}
				}
				else {
				if(count(c[i],b[i])==1)
				{
					sum+=1;
					c[i]=c[i]-1;
					b[i]=b[i]-1;
					
				}
				if(count(c[i],a[i])==1)
				{
					sum+=1;
					c[i]=c[i]-1;
					a[i]=a[i]-1;
				}
				if(count(b[i],a[i])==1)
				{
					sum++;
					b[i]=b[i]-1;
					a[i]=a[i]-1;
				}
					
				}
				if(a[i]>0 && b[i]>0 && c[i]>0)
				{	sum=sum+1;
				  a[i]=a[i]-1;
				  b[i]=b[i]-1;
				  c[i]=c[i]-1;
					
			     
				}
				System.out.println(sum);
			}
			
			
	}
	public static int count(int x,int y)
	{
		if(x>0 && y>0)
			return 1;
		else 
			return 0;
	}
				

			
}

		
	



