#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define popcount __builtin_popcount
#define case cout<<"Case "<<__testcase-testcase<<":";
#define endl '\n'
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int testcase=1;
    cin>>testcase;
    int __testcase=testcase;
    string s = "UUU UUC UUA UUG CUU CUC CUA CUG AUU AUC AUA AUG GUU GUC GUA GUG UCU UCC UCA UCG AGU AGC CCU CCC CCA CCG ACU ACC ACA ACG GCU GCC GCA GCG UAU UAC CAU CAC CAA CAG AAU AAC AAA AAG GAU GAC GAA GAG UGU UGC UGG CGU CGC CGA CGG AGA AGG GGU GGC GGA GGG UAA UAG UGA";
    vector<char> ch = {'F', 'L', 'I', 'M', 'V', 'S', 'P', 'T', 'A', 'Y', 'H', 'Q', 'N', 'K', 'D', 'E', 'C', 'W', 'R', 'G', 'X'};
    vector<int> len = {2,6,3,1,4,6,4,4,4,2,2,2,2,2,2,2,2,1,6,4,3};
    unordered_map<string,char> mp;
    int ln = len.size();
    int i=0,j=0;
    while(i<ln){
        for(int k=0;k<len[i];k++,j+=4){
            string t;
            t+=s[j];
            t+=s[j+1];
            t+=s[j+2];
            mp[t]=ch[i];
        }
        i++;
    }
    while(testcase--)
    {
        int n,m,i,j,k;
        string in;
        cin>>in;
        string out;
        for(i=0;i<in.size();i+=3){
            string t;
            t+=in[i];
            t+=in[i+1];
            t+=in[i+2];
            if(mp[t]=='X') break;
            out+=mp[t];
        }
        cout<<out<<endl;
    }
}