import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd


input = lambda :sys.stdin.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

M = int(input())
N = [0,0,0]
for i in range(3)[::-1]:
    t = 10**(4*i)
    N[i] = M // t
    M -= N[i] * t

res = []
C = [1,100,9999]
O = [1,99,9900]
for i in range(3):
    res.append("c"*C[i])
    res.append("o"*O[i])
    res.append("n"*N[i])


S = "".join(res)
print(S)

"""
T = "con"

dp = [0,0,0,0]
dp[0] = 1
for s in S:
    ndp = dp.copy()
    for i in range(3):
        if s == T[i]:
            ndp[i+1] += dp[i]
    dp = ndp

assert dp[3] == M
"""