#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
string s, so;
map<char, char> ma;
int main(){
	s="CARScarsIuVEJxTXsUvOHhngyZKfAYmaqolMNtGQibwdjPrCpekFWzLaySBaPybRMgzYMynY";//letters in Martian
	so="UnilEPFLvpVZzBNtLSCubWmaocIYneAPqxDshRkMGgJfHrFUQTjXOwdPolyProgisawesome";//corresponding letters in English
	/* next for loop creates the Martian-To-English alphabet */
	for(int i=0; i<s.length(); i++){
		ma.insert(pair<char, char>(s[i], so[i]));
	}
	int n;
	cin>>n;//number of words in string
	so="";//this will be the answer
	for(int i=0; i<n; i++){
		cin>>s;
		/* next for loop translates the string 's' from martian to English and writes it in string 'so' */
		for(int j=0; j<s.length(); j++){
			so+=ma.find(s[j])->second;
			if(j==s.length()-1) so+=" ";
		}
	}
	while(so[so.length()-1] == ' ') so=so.substr(0, so.length()-1);//avoiding trailing spaces
	string b="";
	int i=0;
	while(so[i] == ' '){//avoiding leading spaces
		i++;
	}
	for(i; i<so.length(); i++){
		b+=so[i];
	}
	cout<<so;
	return 0;
}