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.

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */

public class Code
{
  static int[] getBinary(int n) {
    int res[] = new int[3];
    for (int i=2;i>=0;i--) {
      res[i] = n%2;
      n /= 2;
    }
    return res;
  }
  
  static boolean allVisited(int n[]) {
    for(int i=1;i<n.length;i++){
      if(n[i]==0) {
        return false;
      } 
    }
    return true;
  }
  
  static int maxAt(int n[]) {
    int idx = 0;
    for(int i =1;i<n.length;i++) {
      idx = n[idx]>n[i]?idx:i;
    }
    return idx;
  }
  
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner input = new Scanner(System.in);
    int t = input.nextInt();
    int a = 0, b = 0, c = 0;
    int visitors = 0;
    
    ArrayList<int[]> order = new ArrayList<int[]>();
    order.add(new int[]{4,1,2,5,6,3,7});
    order.add(new int[]{2,1,4,3,6,5,7});
    order.add(new int[]{1,2,4,3,5,6,7});
    
    for (int i=0;i<t;i++) {
      int[] portions = new int[3];
      int[] visited = new int[8];
      portions[0] = input.nextInt();
      portions[1] = input.nextInt();
      portions[2] = input.nextInt();
      visitors = 0;
      
      while(!allVisited(visited)) {
        int max = maxAt(portions);
        int suborder[] = order.get(max);
        for(int no : suborder) {
          if(visited[no]==0) {
            visited[no] = 1;
            int bin[] = getBinary(no);
            portions[0] -= bin[0];
            portions[1] -= bin[1];
            portions[2] -= bin[2];
            // System.out.println("Bin:" + bin[0] + " " + bin[1] + " " + bin[2]);
            // System.out.println("portions: " + portions[0] + " " + portions[1] + " " + portions[2]);
            if (portions[0]>=0 && portions[1] >= 0 && portions[2] >= 0) {
              visitors++;
            } else {
              portions[0] += bin[0];
              portions[1] += bin[1];
              portions[2] += bin[2];
            }
          }
        }
      }
      System.out.println(visitors);
    }
	}
}

