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.
from math import factorial
for t in range(int(input())):
	a,b,c = [int(j) for j in input().split()]
	d = [[a, 0], [b, 1], [c, 2]]
	p = ["a", "b", "c", "ab", "bc", "ca", "abc"]
	ans = 0

	for i in range(3):
		if d[i][0]>0:
			d[i][0]-=1
			ans+=1
	d = sorted(d)
	for i in range(3, 0, -1):
		if d[3-i-1][0]>0 and d[3-i-2][0]>0:
			ans+=1
			d[3-i-1][0]-=1
			d[3-i-2][0]-=1
	for i in range(3):
		if d[i][0]>0:
			continue
		else:
			break
	else:
		ans+=1
	print(ans)


		
	# for i in p:
	# 	print(i,d)
	# 	for j in i:
	# 		if d[j]>0:
	# 			continue
	# 		else:
	# 			break
	# 	else:
	# 		for j in i:
	# 			d[j]-=1
	# 		ans+=1
	# 		print(ans)
	# print(ans)

				
	# def fun(x, y):
	# 	if y>x:
	# 		return 0
	# 	else:
	# 		return factorial(x)/(factorial(y)*factorial(x-y))
	# a,b,c = [int(j) for j in input().split()]
	# ans = 0
	# req = [1, 3, 5]
	# for i in range(1,4):
	# 	ct = 0
	# 	for j in [a,b,c]:
	# 		if j>=i:
	# 			ct+=1
	# 	ans+=fun(ct, i)
	# 	print(ans, ct)
	# print(ans)