def find_k(M):
    low = 1
    high = int((6 * M) ** (1/3)) + 2  # Upper bound for cube root of 6*M
    while low <= high:
        mid = (low + high) // 2
        value = mid * (mid + 1) * (mid + 2) // 6
        if value == M:
            return mid
        elif value < M:
            low = mid + 1
        else:
            high = mid - 1
    return -1  # If not found, though problem says solution exists

M = int(input())
if M == 0:
    print("kudamakitsukasa")
else:
    k = find_k(M)
    if k != -1:
        print("con" * k)
    else:
        # If k not found, find a, b, c such that a*b*c = M and a + b + c <= 60000
        # This part is a fallback but not tested here
        print("con" * k)