Fast Food Restaurant

Tired of boring office work, Denis decided to open a fast food restaurant.

On the first day he made aa portions of dumplings, bb portions of cranberry juice and cc 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 tt (1 \le t \le 5001≤t≤500) — the number of test cases to solve.

Each of the remaining tt lines contains integers aa, bb and cc (0 \leq a, b, c \leq 100≤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.

Sample 1

Inputcopy	Outputcopy
7 1 2 1 0 0 0 9 1 7 2 2 3 2 3 2 3 2 2 4 4 4	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.

题意：

一个餐馆有三种菜，每种菜分别有a、b、c份，给客人上菜遵循如下规则：不能上重复的一份菜给一个客人；每个客人点的菜不能完全一样。问最多满足多少客人。

思路：

按一份、两份和三份的顺序模拟上菜，其中两份应该优先上多的菜。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
void slove(){
    int t;
    cin>>t;
    while(t--){
        int a,b,c;
        cin>>a>>b>>c;
        if(a<b){
            int t=a;
            a=b;
            b=t;
        }
        if(a<c){
            int t=a;
            a=c;
            c=t;
        }
        int ans=0;
        if(a>0){
            ans+=1;
            a-=1;
        }
        if(b>0){
            ans+=1;
            b-=1;
        }
        if(c>0){
            ans+=1;
            c-=1;
        }
        if(a>0 && b>0){
            ans+=1;
            a-=1;
            b-=1;
        }
        if(a>0 && c>0){
            ans+=1;
            a-=1;
            c-=1;
        }
        if(b>0 && c>0){
            ans+=1;
            b-=1;
            c-=1;
        }
        if(a>0 && b>0 && c>0){
            ans+=1;
        }
        cout<<ans<<endl;
    }
}
int main(){
    slove();
}