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;
const long long MAX_INF = 0x3f3f3f3f3f3f3f3f;
const long long INF = 0x3f3f3f3f;
const long long maxn = 100009;
const long long maxm = 40009;
const long long mod = 998244353;
inline long long _() {
  long long f = 1, x = 0;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -1;
  } while (ch < '0' || ch > '9');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return f * x;
}
long long t[3];
long long a[7][3] = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {1, 1, 0},
                     {1, 0, 1}, {0, 1, 1}, {1, 1, 1}};
long long ans;
long long tmp[3];
bool book[7], ok;
void dfs(long long pos, long long xz) {
  if (pos == xz) {
    long long pd[3];
    for (long long i = 0; i < 3; i++) pd[i] = tmp[i];
    sort(pd, pd + 3);
    for (long long i = 0; i < 3; i++)
      if (pd[i] > t[i]) {
        return;
      }
    ok = 1;
    ans = max(ans, xz);
    return;
  }
  for (long long i = 0; i < 7; i++) {
    if (book[i]) continue;
    for (long long j = 0; j < 3; j++) tmp[j] += a[i][j];
    book[i] = 1;
    dfs(pos + 1, xz);
    for (long long j = 0; j < 3; j++) tmp[j] -= a[i][j];
    book[i] = 0;
    if (ok) return;
  }
}
void solve() {
  ans = 0;
  cin >> t[0] >> t[1] >> t[2];
  sort(t, t + 3);
  for (long long i = 0; i <= 7; i++) {
    memset(tmp, 0, sizeof(tmp));
    memset(book, 0, sizeof(book));
    ok = 0;
    dfs(0, i);
  }
  cout << ans << endl;
  return;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long T;
  cin >> T;
  while (T--) solve();
  return 0;
}
