Xu Xiake in Henan Province（Gym-102028A）

Problem Description

Shaolin Monastery, also known as the Shaolin Temple, is a Chan ("Zen") Buddhist temple in Dengfeng County, Henan Province. Believed to have been founded in the 55-th century CE, the Shaolin Temple is the main temple of the Shaolin school of Buddhism to this day.

Longmen Grottoes, are some of the finest examples of Chinese Buddhist art. Housing tens of thousands of statues of Buddha and his disciples, they are located 1212kilometres (7.57.5 mi) south of present-day Luoyang in Henan province.

White Horse Temple is, according to tradition, the first Buddhist temple in China, established in 6868 AD under the patronage of Emperor Ming in the Eastern Han dynasty capital Luoyang.

The Yuntai Mountain is situated in Xiuwu County, Jiaozuo, Henan Province. The Yuntai Geo Park scenic area is classified as an AAAAA scenic area by the China National Tourism Administration. Situated within Yuntai Geo Park, with a fall of 314 metres, Yuntai Waterfall is claimed as the tallest waterfall in China.

They are the most famous local attractions in Henan Province.

Now it's time to estimate the level of some travellers. All travellers can be classified based on the number of scenic spots that have been visited by each of them.

• A traveller that visited exactly 0 above-mentioned spot is a "Typically Otaku".
• A traveller that visited exactly 1 above-mentioned spot is a "Eye-opener".
• A traveller that visited exactly 2 above-mentioned spots is a "Young Traveller".
• A traveller that visited exactly 3 above-mentioned spots is a "Excellent Traveller".
• A traveller that visited all 4 above-mentioned spots is a "Contemporary Xu Xiake".

Please identify the level of a traveller.

Input

The input contains several test cases, and the first line contains a positive integer T indicating the number of test cases which is up to 104.

For each test case, the only one line contains four integers A1, A2, A3 and A4, where AiAi is the number of times that the traveller has visited the i-th scenic spot, and 0≤A1,A2,A3,A4≤100. If AiAi is zero, it means that the traveller has never been visiting the i-th spot.

Output

For each test case, output a line containing one string denoting the classification of the traveller which should be one of the strings "Typically Otaku", "Eye-opener", "Young Traveller", "Excellent Traveller" and "Contemporary Xu Xiake" (without quotes).

Examples

Input

5
0 0 0 0
0 0 0 1
1 1 0 0
2 1 1 0
1 2 3 4

Output

Typically Otaku
Eye-opener
Young Traveller
Excellent Traveller
Contemporary Xu Xiake

题意：t 组查询，每组给出 4 个数，代表去过 4 个地方，如果 4 个数都是 0，输出 Typically Otaku，如果有 3 个 0，输出 Eye-opener，如果有 2 个 0，输出 Young Traveller，如果有 1 个 0，输出 Excellent Traveller，如果没有 0，输出 Contemporary Xu Xiake

思路：简单模拟

Source Program

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
#define Pair pair<int,int>
const int MOD = 1E9+7;
const int N = 5000+5;
const int dx[] = {1,-1,0,0,-1,-1,1,1};
const int dy[] = {0,0,-1,1,-1,1,-1,1};
using namespace std;

string str[]= {"Contemporary Xu Xiake","Excellent Traveller","Young Traveller","Eye-opener","Typically Otaku"};
int main() {
    int n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++) {
        int cnt=0;
        for(int j=1; j<=4; j++) {
            int x;
            scanf("%d",&x);
            if(x!=0)
                cnt++;
        }
        cout<<str[cnt]<<endl;
    }
    return 0;
}