import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
k = int(input())
ans = []
for i in itertools.product([1,2],repeat=4):
    temp = []
    temp += ['N']
    if i[0] == 2:
        temp += temp[:]
    
    temp += ['U']
    if i[1] == 2:
        temp += temp[:]
    
    temp += ['P']
    if i[2] == 2:
        temp += temp[:]

    temp += ['C']
    if i[3] == 2:
        temp += temp[:]
    ans.append(''.join(temp))
ans.sort()
print(ans[k-1])