#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;

const int N = 4;
const int M = 8;

    string ba[M + 3] = {"-F", "-Cl", "-Br", "-I", "-CH3", "-CH2CH3", "-CH2CH2CH3", "-H"};
    map<string, int>rk;
    string R[N  +3];
    int r[N + 3];

void sol(){
    for(int i = 1; i <= N; i++){
        cin >> R[i];
        r[i] = rk[R[i]];
    }

    if(r[1] == r[3] || r[2] == r[4]){
        printf("None\n");
        return ;
    }

    if(r[1] == r[2] || r[3] == r[4]){
        printf("Cis\n");
        return ;
    }

    if(r[1] == r[4] || r[2] == r[3]){
        printf("Trans\n");
        return ;
    }

    if(r[1] < r[3] && r[1] < r[4] && r[2] < r[3] && r[2] < r[4]){
        printf("Zasamman\n");
        return ;
    }

    if(r[3] < r[1] && r[3] < r[2] && r[4] < r[1] && r[4] < r[2]){
        printf("Zasamman\n");
        return ;
    }

    printf("Entgegen\n");
}

int main(){
    rk.clear();
    for(int i = 0; i < M; i++)
        rk[ba[i]] = i;

    int T;
    scanf("%d\n", &T);
    while(T--)
        sol();

    return 0;
}