#include using namespace std; using ll = long long; using pll = pair; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60LL; const int IINF = (1 << 30) - 1; void solve(){ vector ans; vector key = {'N', 'U', 'P', 'C'}; function dfs = [&](int i, string s){ if(i==8){ ans.pb(s); return; } if(i%2==1){ dfs(i+1, s); dfs(i+1, s+s); }else{ dfs(i+1, s+key[i/2]); } }; dfs(0, ""); sort(all(ans)); int k; cin >> k; cout << ans[k-1] << '\n'; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int T=1; //cin >> T; while(T--) solve(); }