#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int K;
char S[8] = {'N', '1', 'U', '1', 'P', '1', 'C', '1'};
string T;
queue<string> Q;
vector<string> vec;

int main(void){
  cin >> K;
  Q.push("");
  for (int i = 0; i < 8; i++) {
    queue<string> Q2;
    while (!Q.empty()) {
      T = Q.front(); Q.pop();
      if (i % 2 == 0) {
        Q2.push(T + S[i]);
      } else {
        for (int i = 1; i <= 2; i++) {
          if (i == 1) Q2.push(T);
          if (i == 2) Q2.push(T + T);
        }
      }
    }
    swap(Q, Q2);
  }
  while (!Q.empty()) {
    T = Q.front(); Q.pop();
    vec.push_back(T);
  }
  sort(vec.begin(), vec.end());
  cout << vec[K - 1] << endl;
  return 0;
}