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.
#include <bits/stdc++.h>
using namespace std;
int func1(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int func2(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int func3(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int func4(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int func5(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int func6(int a, int b, int c) {
  int counter = 0;
  bool b_a = true, b_b = true, b_c = true, b_a_c = true, b_a_b = true,
       b_b_c = true, b_a_c_b = true;
  if (a && b_a) {
    a -= 1;
    counter += 1;
    b_a = false;
  }
  if (b && b_b) {
    b -= 1;
    counter += 1;
    b_b = false;
  }
  if (c && b_c) {
    c -= 1;
    counter += 1;
    b_c = false;
  }
  if (b && a && b_a_b) {
    a -= 1;
    b -= 1;
    counter += 1;
    b_a_b = false;
  }
  if (c && b && b_b_c) {
    b -= 1;
    c -= 1;
    counter += 1;
    b_b_c = false;
  }
  if (c && a && b_a_c) {
    a -= 1;
    c -= 1;
    counter += 1;
    b_a_c = false;
  }
  if (c && a && b && b_a_c_b) {
    a -= 1;
    c -= 1;
    b -= 1;
    counter += 1;
    b_a_c_b = false;
  }
  return counter;
}
int max(int arr[]) {
  int max_el = 0;
  for (int i = 0; i < 6; i++) {
    if (max_el < arr[i]) max_el = arr[i];
  }
  return max_el;
}
int main() {
  int cases, a, b, c, results[10000], arr[6];
  cin >> cases;
  for (int i = 0; i < cases; i++) {
    cin >> a >> b >> c;
    arr[0] = func1(a, b, c);
    arr[1] = func2(a, b, c);
    arr[2] = func3(a, b, c);
    arr[3] = func4(a, b, c);
    arr[4] = func5(a, b, c);
    arr[5] = func6(a, b, c);
    results[i] = max(arr);
  }
  for (int i = 0; i < cases; i++) cout << results[i] << endl;
}
