from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

M = int(input())

def fcr(n):
    
    ng = math.ceil(n**(1/3)) + 100
    
    ok = math.ceil(n**(1/3)) - 100
    while ng-ok>1:
        mid = (ng+ok)//2
        
        if mid**3<=n:
            ok = mid
        else:
            ng = mid
    return ok
    
    
N = fcr(M)
for k in range(-1,2):
    W = N + k
    flg = False
    for i in range(-1000,1000):
        Z = N+i
        for j in range(-1000,1000):
            Y = N+j
            if (1< M - W*((Y+1)*Z+1) + W + Y + Z<=59998)&(M >= W*((Y+1)*Z+1)):
                flg = True
                break
        if flg:
            break
    if flg:
        break

    
    
    
X = M - W*(Z*(Y+1)+1)
ans = ['c','o'] + ['n']*X + ['c']*Y + ['o']*Z + ['n']*W
print(''.join(ans))