def find_k(M):
    low = 0
    high = 2 * 10**5  # 足夠大的上界
    k = 0
    while low <= high:
        mid = (low + high) // 2
        val = mid * (mid + 1) * (mid + 2) // 6
        if val == M:
            return mid
        elif val < M:
            low = mid + 1
        else:
            high = mid - 1
    return high

M = int(input())
if M == 0:
    print("kudamakitsukasa")
else:
    k = find_k(M)
    d = M - k * (k + 1) * (k + 2) // 6
    s = 'con' * k + 'x' * d
    print(s)