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>
int out(int a, int b, int c) {
  int output = 0;
  if (a > 0 && b > 0) {
    output++;
    a--;
    b--;
  }
  if (a > 0 && c > 0) {
    output++;
    a--;
    c--;
  }
  if (b > 0 && c > 0) {
    output++;
    b--;
    c--;
  }
  return output;
}
void out2(int *a, int *b, int *c) {
  if (*a > 0 && *b > 0) {
    *a -= 1;
    *b -= 1;
  }
  if (*a > 0 && *c > 0) {
    *a -= 1;
    *c -= 1;
  }
  if (*b > 0 && *c > 0) {
    *b -= 1;
    *c -= 1;
  }
}
int findMax(int *a, int *b, int *c) {
  int arr[6];
  arr[0] = out(*a, *b, *c);
  arr[1] = out(*a, *c, *b);
  arr[2] = out(*b, *c, *a);
  arr[3] = out(*b, *a, *c);
  arr[4] = out(*c, *a, *b);
  arr[5] = out(*c, *b, *a);
  int output = 0, index = 0;
  for (int i = 0; i < 6; i++)
    if (arr[i] > output) {
      output = arr[i];
      index = i;
    }
  switch (index) {
    case 0:
      out2(a, b, c);
      break;
    case 1:
      out2(a, c, b);
      break;
    case 2:
      out2(b, c, a);
      break;
    case 3:
      out2(b, a, c);
      break;
    case 4:
      out2(c, a, b);
      break;
    case 5:
      out2(c, b, a);
      break;
  }
  return output;
}
int main() {
  int tc;
  scanf("%d", &tc);
  while (tc--) {
    int a, b, c;
    int output = 0;
    scanf("%d %d %d", &a, &b, &c);
    if (a > 0) {
      output++;
      a--;
    }
    if (b > 0) {
      output++;
      b--;
    }
    if (c > 0) {
      output++;
      c--;
    }
    output += findMax(&a, &b, &c);
    if (a > 0 && b > 0 && c > 0) {
      output++;
      a--;
      b--;
      c--;
    }
    printf("%d\n", output);
  }
  return 0;
}
