#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;

int main(){

	char buf[1001],ret[3];

	scanf("%s",buf);

	for(int i = 0; buf[i] != '\0'; i += 2){

		switch(buf[i]){
		case '0':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'w',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'n',ret[1] = 'n',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'w',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '1':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'a',ret[1] = '\0';
				break;
			case 'L':
				ret[0] = 'i',ret[1] = '\0';
				break;
			case 'U':
				ret[0] = 'u',ret[1] = '\0';
				break;
			case 'R':
				ret[0] = 'e',ret[1] = '\0';
				break;
			case 'D':
				ret[0] = 'o',ret[1] = '\0';
				break;
			}
			break;
		case '2':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'k',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 'k',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'k',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 'k',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'k',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '3':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 's',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 's',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 's',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 's',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 's',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '4':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 't',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 't',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 't',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 't',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 't',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '5':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'n',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 'n',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'n',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 'n',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'n',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '6':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'h',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 'h',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'h',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 'h',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'h',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '7':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'm',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 'm',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'm',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 'm',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'm',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '8':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'y',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'y',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'y',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		case '9':
			switch(buf[i+1]){
			case 'T':
				ret[0] = 'r',ret[1] = 'a',ret[2] = '\0';
				break;
			case 'L':
				ret[0] = 'r',ret[1] = 'i',ret[2] = '\0';
				break;
			case 'U':
				ret[0] = 'r',ret[1] = 'u',ret[2] = '\0';
				break;
			case 'R':
				ret[0] = 'r',ret[1] = 'e',ret[2] = '\0';
				break;
			case 'D':
				ret[0] = 'r',ret[1] = 'o',ret[2] = '\0';
				break;
			}
			break;
		}
		printf("%s",ret);
	}
	printf("\n");

	return 0;
}

Measured memory_bytes: 2728