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>
#pragma GCC optimize("O3")
using namespace std;
const long long MOD = 1e9 + 7;
long long isPrime(long long n) {
  if (n < 2) return 0;
  for (long long i = 2; i * i <= n; i += 1)
    if (n % i == 0) return 0;
  return 1;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fact(long long n) {
  if (n == 1) {
    return 1;
  } else {
    return n * fact(n - 1);
  }
}
long long isperfectsquare(long long n) {
  long long k = sqrt(n);
  if (n % k == 0 && n / k == k) {
    return 1;
  } else {
    return 0;
  }
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, q, i, j, x, y, z;
  long long ct(0), pt(0);
  cin >> q;
  while (q--) {
    long long a, b, c;
    cin >> a >> b >> c;
    long long d[3];
    d[0] = a;
    d[1] = b;
    d[2] = c;
    sort(d, d + 3, greater<long long>());
    long long s = 0;
    if (d[0] > 0) {
      s += 1;
      d[0] -= 1;
    }
    if (d[1] > 0) {
      s += 1;
      d[1] -= 1;
    }
    if (d[2] > 0) {
      s += 1;
      d[2] -= 1;
    }
    if (d[0] > 0 && d[1] > 0) {
      s += 1;
      d[1] -= 1;
      d[0] -= 1;
    }
    if (d[0] > 0 && d[2] > 0) {
      s += 1;
      d[0] -= 1;
      d[2] -= 1;
    }
    if (d[1] > 0 && d[2] > 0) {
      s += 1;
      d[1] -= 1;
      d[2] -= 1;
    }
    if (d[0] > 0 && d[1] > 0 && d[2] > 0) {
      s += 1;
      d[0] -= 1;
      d[1] -= 1;
      d[2] -= 1;
    }
    cout << s << endl;
  }
}
