# 16種しかないのだから全列挙して辞書順に並べる

NUPC = ['N', 'U', 'P', 'C']

import sys
sys.setrecursionlimit(10**7)

def dfs(nums):
    if len(nums)==4:
        nums_list.append(nums)
        return
    
    for i in range(1, 3):
        dfs(nums+[i])

nums_list = []
dfs([])

#print(nums_list)

all_combo = []
for nums in nums_list:
    s = ''
    for i in range(8):
        if i%2 == 0:
            s += NUPC[i//2]
        else:
            if nums[i//2]==1:
                pass
            elif nums[i//2]==2:
                s += s
    all_combo.append(s)
all_combo.sort()
    
#print(all_combo)

K = int(input())
print(all_combo[K-1])