#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

char ch(char n) { 
  if(n=='2') return 'k';
  if(n=='3') return 's';
  if(n=='4') return 't';
  if(n=='5') return 'n';
  if(n=='6') return 'h';
  if(n=='7') return 'm';
  if(n=='8') return 'y';
  if(n=='9') return 'r';
}

char ch2(char c) {
  if(c=='T') return 'a';
  if(c=='L') return 'i';
  if(c=='U') return 'u';
  if(c=='R') return 'e';
  return 'o';
}
  
int main() {
  string s;
  cin >> s;
  string t="";
  rep(i,(int)s.size()/2) {
    if(s[i*2]>='1' && s[i*2]<='9') {
      if(s[i*2]>='2') t+=ch(s[i*2]);
      t+=ch2(s[i*2+1]);
    } else {
      if(s[i*2+1]=='T') t+="wa";
      else if(s[i*2+1]=='U') t+="nn";
      else t+="wo";
    }
  }
  pr(t);
  return 0;
}
