#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll k;
  cin >> k;
  vector<string> ts;
  rep(a, 2) rep(b, 2) rep(c, 2) rep(d, 2) {
    string t = ""s;
    t += "N"s;
    if (a)
      t += t;
    t += "U"s;
    if (b)
      t += t;
    t += "P"s;
    if (c)
      t += t;
    t += "C"s;
    if (d)
      t += t;
    ts.push_back(t);
  }
  sort(ts.begin(), ts.end());
  cout << ts[k - 1] << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}