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 java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class t1Right {
	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
			String[] outputArr = new String[Integer.parseInt(reader.readLine())];
			String in;
			int mainCounter = 0;
			while ((in = reader.readLine()) != null) {
				int[] abc = new int[3];
				StringTokenizer st = new StringTokenizer(in, " ");
				int counter = 0;
				while (st.hasMoreTokens()) {
					abc[counter] = Integer.parseInt(st.nextToken());
					counter++;
				}
				var output = 0;
				if (abc[0] < abc[1]) { //2 1
					abc[0] += abc[1]; //3 1
					abc[1] = abc[0] - abc[1]; //3 2
					abc[0] = abc[0] - abc[1]; //1 2
				}
				if (abc[1] < abc[2]) {
					abc[1] += abc[2];
					abc[2] = abc[1] - abc[2];
					abc[1] = abc[1] - abc[2];
				}
				if (abc[0] < abc[1]) {
					abc[0] += abc[1];
					abc[1] = abc[0] - abc[1];
					abc[0] = abc[0] - abc[1];
				}
				if (abc[0] > 0) {
					abc[0]--;
					output++;
				}
				if (abc[1] > 0) {
					abc[1]--;
					output++;
				}
				if (abc[2] > 0) {
					abc[2]--;
					output++;
				}
				if (abc[0] > 0 && abc[1] > 0) {
					abc[0]--;
					abc[1]--;
					output++;
				}
				if (abc[0] > 0 && abc[2] > 0) {
					abc[0]--;
					abc[2]--;
					output++;
				}
				if (abc[1] > 0 && abc[2] > 0) {
					abc[1]--;
					abc[2]--;
					output++;
				}
				if (abc[0] > 0 && abc[1] > 0 && abc[2] > 0) {
					output++;
				}
				outputArr[mainCounter] = String.valueOf(output);
				mainCounter++;
			}
			System.out.println(String.join("\n", outputArr));
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
