#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e3 + 5 , MOD = 1e9 + 7 ;


int main()
{
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);


    map< string , char > mp ;

    string a[] = {"FUUUUUC", "LUUAUUGCUUCUCCUACUG", "IAUUAUCAUA", "MAUG", "VGUUGUCGUAGUG", "SUCUUCCUCAUCGAGUAGC", "PCCUCCCCCACCG", "TACUACCACAACG", "AGCUGCCGCAGCG", "YUAUUAC", "HCAUCAC", "QCAACAG", "NAAUAAC", "KAAAAAG", "DGAUGAC", "EGAAGAG", "CUGUUGC", "WUGG", "RCGUCGCCGACGGAGAAGG", "GGGUGGCGGAGGG"} ;


    for(string s : a)
    {
        for(int i = 1 ; i < (int)s.size() ; i += 3)
        {
            mp[s.substr(i , 3)] = s[0] ;
        }
    }


    int t= 1;
    cin >> t;
    while (t--)
    {
        string s ;
        cin >> s;

        for(int i =0 ; i < (int)s.size() ; i += 3)
        {
            if( mp.find(s.substr( i , 3)) != mp.end() ) cout << mp[s.substr(i , 3)] ;
            else{
                cout << "\n" ;
                break;
            }

            if(i+3 == (int)s.size()) cout << "\n";
        }
    }

    return 0;
}