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.
//package CodeForces.C622;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.util.stream.Collectors;

public class A {


    public static void main(String[] args) {
        int t = in.NI();
        while(t-->0) {
            int a = in.NI(), b = in.NI(), c = in.NI();
            int ans = 0;

            List<Integer> l = new ArrayList<>();
            l.add(a); l.add(b); l.add(c);
            l = l.stream().filter(x -> x>0).collect(Collectors.toList());
            l.sort(Comparator.comparingInt(o -> o));

            ans += l.size();
            for (int i=0;i<l.size();i++){
                int val = l.get(i);
                l.set(i, val-1);
            }
            l = l.stream().filter(x -> x>0).collect(Collectors.toList());
            l.sort(Comparator.comparingInt(o -> o));

            int si = l.size();
            if (si>=3) {
                int v1 = l.get(2); int v2 = l.get(1);
                ans++; l.set(2, v1-1); l.set(1, v2-1);

                v1 = l.get(2); v2 = l.get(0);
                if (v1>0) {ans++; l.set(2, v1-1); l.set(0, v2-1);}

                v1 = l.get(1); v2 = l.get(0);
                if (v1>0 && v2>0) {ans++; l.set(1, v1-1); l.set(0, v2-1);}
            }
            else if (si>=2) {
                int v1, v2;
                v1 = l.get(1); v2 = l.get(0);
                if (v1>0 && v2>0) {ans++; l.set(1, v1-1); l.set(0, v2-1);}
            }

            l = l.stream().filter(x -> x>0).collect(Collectors.toList());
            l.sort(Comparator.comparingInt(o -> o));

            si = l.size();
            if (si>=3){
                ans++;
            }

            out.println(ans);

        }
        out.close();
    }

    static InputStream inputStream = System.in;
    static OutputStream outputStream = System.out;
    static InputReader in = new InputReader(inputStream);
    static PrintWriter out = new PrintWriter(outputStream);

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int NI() {
            return Integer.parseInt(next());
        }

        public long NL() {
            return Long.parseLong(next());
        }

    }
}