#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }

void solve() {
	int n;
	while (cin >> n) {
		switch (n) {
		case 0:
			return;
			break;
		case 1:
			cout << "y" << endl;
			break;
		case 2:
			cout << "u" << endl;
			break;
		case 3:
			cout << "k" << endl;
			break;
		case 4:
			cout << "i" << endl;
			break;
		case 5:
			cout << "c" << endl;
			break;
		case 6:
			cout << "o" << endl;
			break;
		case 7:
			cout << "d" << endl;
			break;
		case 8:
			cout << "e" << endl;
			break;
		case 9:
			cout << "r" << endl;
			break;
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	solve();
	return 0;
}