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 double PI = 3.1415926;
const int KL = 1e6;
using namespace std;
long long q, x, y, z, n, m, p[KL], mn = 1e9, mx = -1e9, ans;
string t;
vector<long long> vec;
set<int> s;
map<int, int> M;
int main() {
  scanf("%lld", &n);
  while (n--) {
    scanf("%lld", &x);
    scanf("%lld", &y);
    scanf("%lld", &z);
    long long cnt = 0;
    if (x > 0) {
      cnt++;
      x--;
    }
    if (y > 0) {
      cnt++;
      y--;
    }
    if (z > 0) {
      cnt++;
      z--;
    }
    if (x >= 2 || y >= 2 || z >= 2) {
      if (x >= 2 && y >= 2 && z >= 2) {
        cnt += 3;
        x -= 2;
        z -= 2;
        y -= 2;
      } else if (x >= 2) {
        if (y != 0 && z != 0) {
          cnt += 2;
          x -= 2;
          y -= 1;
          z -= 1;
        } else if (z != y)
          cnt += 1;
      } else if (y >= 2) {
        if (x != 0 && z != 0) {
          cnt += 2;
          y -= 2;
          x -= 1;
          z -= 1;
        } else if (z != x)
          cnt += 1;
      } else if (z >= 2) {
        if (y != 0 && x != 0) {
          cnt += 2;
          z -= 2;
          x -= 1;
          y -= 1;
        } else if (y != x)
          cnt += 1;
      }
    } else {
      if (x >= 1 && y >= 1) {
        cnt += 1;
        x -= 1;
        y -= 1;
      }
      if (x >= 1 && z >= 1) {
        cnt += 1;
        x -= 1;
        z -= 1;
      }
      if (y >= 1 && z >= 1) {
        cnt += 1;
        y -= 1;
        z -= 1;
      }
    }
    if (x > 0 && y > 0 && z > 0) {
      cnt++;
    }
    cout << cnt << endl;
  }
  return 0;
}
