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 mod = 1000000007;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
long long qpow(long long a, long long b) {
  long long s = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      s = s * a;
    }
    a = a * a;
    b = b >> 1;
  }
  return s;
}
long long qpowmod(long long a, long long b, long long c) {
  long long res, t;
  res = 1;
  t = a % c;
  while (b) {
    if (b & 1) {
      res = res * t % c;
    }
    t = t * t % c;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long read() {
  long long k = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    k = k * 10 + ch - '0';
    ch = getchar();
  }
  return k * f;
}
inline void write(long long x) {
  if (x < 0) x = -x, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
long long t, a, b, c, ans;
int main() {
  cin >> t;
  while (t--) {
    cin >> a >> b >> c;
    ans = 0;
    if (a >= 1) {
      a--;
      ans++;
    }
    if (b >= 1) {
      b--;
      ans++;
    }
    if (c >= 1) {
      c--;
      ans++;
    }
    if (a >= b && a >= c) {
      if (a >= 1 && b >= 1) {
        a--;
        b--;
        ans++;
      }
      if (a >= 1 && c >= 1) {
        a--;
        c--;
        ans++;
      }
      if (b >= 1 && c >= 1) {
        b--;
        c--;
        ans++;
      }
    } else if (b >= a && b >= c) {
      if (b >= 1 && a >= 1) {
        a--;
        b--;
        ans++;
      }
      if (b >= 1 && c >= 1) {
        b--;
        c--;
        ans++;
      }
      if (a >= 1 && c >= 1) {
        a--;
        c--;
        ans++;
      }
    } else if (c >= b && c >= a) {
      if (c >= 1 && b >= 1) {
        c--;
        b--;
        ans++;
      }
      if (c >= 1 && a >= 1) {
        a--;
        c--;
        ans++;
      }
      if (a >= 1 && b >= 1) {
        a--;
        b--;
        ans++;
      }
    }
    if (a >= 1 && b >= 1 && c >= 1) {
      ans++;
    }
    cout << ans << "\n";
  }
  return 0;
}
