#include using namespace std; //#include //using namespace atcoder; //using mint = modint998244353; //多倍長整数// //#include //namespace mp = boost::multiprecision; //using Bint = mp::cpp_int; const int INF = 1e9; const int MOD = 998244353; const long long LINF = 4e18; using ll = long long; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using vb = vector; using vvi = vector>; using vvvi = vector>>; using vvvvi = vector>>>; using vvl = vector>; using vvvl = vector>>; using vvvvl = vector>>>; using vvc = vector>; using vvb = vector>; using vvvb = vector>>; using vvvvb = vector>>>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define dump(x) cout << #x << " = " << (x) << endl; #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define ALL(obj) (obj).begin(),(obj).end() int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); vs ans; rep(j,2){ rep(k,2){ rep(l,2){ rep(m,2){ string a = ""; a.push_back('N'); if(j){ a = a+a; } a.push_back('U'); if(k){ a = a+a; } a.push_back('P'); if(l){ a = a + a; } a.push_back('C'); if(m){ a = a + a; } ans.push_back(a); } } } } sort(ALL(ans)); int k; cin >> k; cout << ans[k - 1] << endl; return 0; }