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.
n=int(input())
def f(a,b,ans):
	z1=min(a,b)
	if(z1>0):
		a-=1
		b-=1
		z1=1
		ans+=1
		return a,b,ans
	return a,b,ans
def f2(a,b,c):
	a1=0
	a,b,a1=f(a,b,a1)

	b,c,a1=f(b,c,a1)
	
	c,a,a1=f(a,c,a1)
	z4=min(a,b,c)
	# print(z4,"lol",a,b,c)
	ans=0
	if(z4>0):
		ans=1
	ans+=a1
	# print(ans)

	return ans

for i in range(n):
	a,b,c=map(int,input().split(" "))
	ans=0

	if(a>0):
		a-=1
		ans+=1
		# print(ans,"lol")
	if(b>0):
		b-=1
		ans+=1
		# print(ans,"lol")
	if(c>0):
		c-=1
		ans+=1
		# print(ans,"lol")

	z=0
	d={}
	# print(ans,"lol1",a,b,c)
	# while(z<4):
	# 	if(c<=a and c<=b and d.get("ab",0)==0):
	# 		a,b,ans=f(a,b,ans)
	# 		d["ab"]=1
	# 	elif(a<=b and a<=c and d.get("bc",0)==0):
	# 		b,c,ans=f(b,c,ans)
	# 		d["bc"]=1
	# 	elif(b<=a and b<=c and d.get("ca",0)==0):
	# 		a,c,ans=f(a,c,ans)
	# 		d["ca"]=1
		# print(ans)
		# z+=1
	# print(ans,"lol2")
	a1=f2(a,b,c)
	a2=f2(b,c,a)
	a3=f2(a,c,b)
	a4=f2(b,a,c)
	a5=f2(c,a,b)
	a6=f2(c,b,a)

	


	
	
	print(ans+max(a1,a2,a3,a4,a5,a6))
	# break