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())
ar = [[1,0,0], [0,1,0], [0,0,1]]

ar1 =[[1,1,0], [1,0,1], [0,1,1], [1,1,1]]
ar2 =[[1,1,0], [0,1,1], [1,0,1], [1,1,1]]

ar3 =[[1,0,1], [1,1,0], [0,1,1], [1,1,1]]
ar4 =[[1,0,1], [0,1,1], [1,1,0], [1,1,1]]

ar5 =[[0,1,1], [1,1,0], [1,0,1], [1,1,1]]
ar6 =[[0,1,1], [1,0,1], [1,1,0], [1,1,1]]
for z in range(n):
    cnt = 0
    amount = list(map(int, input().split()))
    for j in ar:
        if ((amount[0] -  j[0]))  >= 0 and ((amount[1] - j[1]) >= 0) and ((amount[2] - j[2]) >=0):
            amount[0]-=j[0]
            amount[1]-=j[1]
            amount[2]-=j[2]
            cnt+=1
    
    a = [ar1, ar2, ar3, ar4, ar5, ar6]
    mxcnt = 0
    for ari in a:
        cntNow = 0
        nowamount = amount.copy()
        for j in ari:
            if ((nowamount[0] -  j[0]))  >= 0 and ((nowamount[1] - j[1]) >= 0) and ((nowamount[2] - j[2]) >=0):
                nowamount[0]-=j[0]
                nowamount[1]-=j[1]
                nowamount[2]-=j[2]
                cntNow+=1
        mxcnt = max(mxcnt, cntNow)
    print(cnt+ mxcnt)
        
            