#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        vector<string>p;
        for (int i1 = 1; i1 <= 2; i1++) {          
            for (int i2 = 1; i2 <= 2; i2++) {               
                for (int i3 = 1; i3 <= 2; i3++) {                    
                    for (int i4 = 1; i4 <= 2; i4++) {
                        string t = "N";
                        if (i1 == 2)t.push_back('N');
                        t.push_back('U');
                        if (i2 == 2)t = t + t;
                        t.push_back('P');
                        if (i3 == 2)t = t + t;
                        t.push_back('C');
                        if (i4 == 2)t = t + t;
                        p.push_back(t);
                    }
                }

            }

        }
        sort(p.begin(), p.end());
        int r;
        cin >> r;
        cout << p[r - 1];

    }
        return 0;
}