#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <random>
#include <time.h>
#include <map>
using namespace std;

int k;
vector<string>vec;

string nupc(vector<int>num)
{
    string t = "";
    t += "N";
    if(num[0]==1) t+=t;
    t += "U";
    if(num[1]==1) t+=t;
    t += "P";
    if(num[2]==1) t+=t;
    t += "C";
    if(num[3]==1) t+=t;

    return t;
}

void dfs(int remain, vector<int>num)
{
    if(remain==0)
    {
        vec.push_back(nupc(num));
        return;
    }
    num.push_back(0);
    dfs(remain-1, num);
    num.pop_back();
    num.push_back(1);
    dfs(remain-1, num);
    num.pop_back();
}

int main()
{
    dfs(4,{});
    sort(vec.begin(),vec.end());
    cin >> k;
    cout << vec[k-1] << endl;
}