#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

vector<string> kek = {"F UUU UUC", "L UUA UUG CUU CUC CUA CUG",
"I AUU AUC AUA",
"M AUG",
"V GUU GUC GUA GUG",
"S UCU UCC UCA UCG AGU AGC",
"P CCU CCC CCA CCG",
"T ACU ACC ACA ACG",
"A GCU GCC GCA GCG",
"Y UAU UAC",
"H CAU CAC",
"Q CAA CAG",
"N AAU AAC",
"K AAA AAG",
"D GAU GAC",
"E GAA GAG",
"C UGU UGC",
"W UGG",
"R CGU CGC CGA CGG AGA AGG",
"G GGU GGC GGA GGG",
". UAA UAG UGA"};


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  map<string, char> blocks;
  for (auto s : kek) {
    char c = s[0];
    int i = 2;
    while (i + 3 <= s.size()) {
      blocks[s.substr(i, 3)] = c;
      i += 4;
    }
  }
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i += 3) {
      char c = blocks[s.substr(i, 3)];
      if (c == '.')
        break;
      cout << c;
    }
    cout << '\n';
  }
  return 0;
}