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 packages
import itertools
from operator import sub
# load data
num_cases = int(input())
data_dictionary = {}
for case in range(1, num_cases+1):
    line_1 = input()
    a, b, c = [line_1.split()[i] for i in range(3)]
    data_dictionary[case] = {
    "a": int(a),
    "b": int(b),
    "c": int(c)
    }
# print(data_dictionary)
# now do the thing

sorted_permutations =          [[1, 0, 0],
                                [0, 1, 0],
                                [0, 0, 1],
                                [1, 1, 0],
                                [1, 0, 1],
                                [0, 1, 1],
                                [1, 1, 1]]

# define a function that subtracts one array from another
def subtract(array_1, array_2):

    return list(map(sub, array_1, array_2))

# define a function that takes two arrays and checks if the second can be
# subtracted from the first without any negatives
def check_if_valid_order(array_1, array_2):
    subtracted = subtract(array_1, array_2)
    return all(i >= 0 for i in subtracted)

for case in data_dictionary:
    a = data_dictionary[case]["a"]
    b = data_dictionary[case]["b"]
    c = data_dictionary[case]["c"]
    food = [a, b, c]
    food.sort(reverse = True)

    number_of_orders = 0
    for permutation in sorted_permutations:
        if check_if_valid_order(food, permutation):
            food = subtract(food, permutation)
            number_of_orders += 1
    print(number_of_orders)
