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>
const int maxN = (int)3e5 + 100;
const unsigned int Modu = 1000000007;
int a[maxN];
using namespace std;
template <class ForwardIterator>
ForwardIterator next(
    ForwardIterator it,
    typename iterator_traits<ForwardIterator>::difference_type n = 1);
bool IsPrime(int number) {
  int root = sqrt(number);
  for (int i = 2; i <= root; i++) {
    if (number % i == 0) return false;
  }
  return true;
}
int countDivisors(int n) {
  int cnt = 0;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        cnt++;
      else
        cnt = cnt + 2;
    }
  }
  return cnt;
}
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) {
      res = ((res % m) * (a % m)) % m;
    }
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
void solve() {
  vector<long long> v;
  int x;
  for (int i = 0; i < 3; i++) {
    cin >> x;
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  int a, b, c, res = 0;
  a = v[0];
  b = v[1];
  c = v[2];
  if (a > 0) {
    a--;
    res++;
  }
  if (b > 0) {
    b--;
    res++;
  }
  if (c > 0) {
    c--;
    res++;
  }
  if (a > 0 and b > 0) {
    a--;
    b--;
    res++;
  }
  if (a > 0 and c > 0) {
    a--;
    c--;
    res++;
  }
  if (b > 0 and c > 0) {
    b--;
    c--;
    res++;
  }
  if (a > 0 and b > 0 and c > 0) {
    res++;
  }
  cout << res << endl;
  ;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
