import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

M=int(readline())
cnt=[0]*20001
for i in range(20000,0,-1):
    while i*(i+1)//2<=M:
        M-=i*(i+1)//2
        cnt[i]+=1
ans_lst=[]
for i in range(1,20001):
    ans_lst+=["co"]+["n"]*cnt[i]
print(*ans_lst,sep="")