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 itertools
import copy
t = int(input())

abc_n = [[int(i) for i in input().split()] for j in range(t)]

l = [(0,1),(0,2),(1,2)]

"""
for l in itertools.permutations(l,3):
    print(l[0],l[1])
"""

#print(itertools.permutations(l,4))

ans = 0

for i in range(t):
    abc_new = abc_n[i]
    #print(abc)
    tmp = 0
    
    for j in range(3):
        if abc_new[j] > 0:
            tmp += 1
            abc_new[j] -= 1
    
    tmp_old = tmp
    #abc_copy = copy.deepcopy(abc_new)
    #print(abc_copy)
    #abc_copy = copy.deepcopy(abc)
    ans = 0
    for l in itertools.permutations(l,3):
        abc = copy.deepcopy(abc_new)
        tmp = tmp_old
        #print(abc,l)
        for k in range(3):
            #print(l[k][0],l[k][1],k)
            #print(k)
            #print(abc,l,k,abc[l[k][0]],abc[l[k][1]],tmp)
            if abc[l[k][0]] > 0 and abc[l[k][1]] > 0:
                tmp += 1
                abc[l[k][0]] -= 1
                abc[l[k][1]] -= 1
        #print(abc)
        if abc[0]*abc[1]*abc[2] > 0:
            tmp += 1
        ans = max(ans,tmp)
        #print(ans,tmp,abc)
        #tmp = 0
    print(ans)
    #exit()
        #print(ans)
    #print(ans)
        
