import math

def checkperfectsquare(n):
    sqrt = int(math.sqrt(n))
    if pow(sqrt, 2) == n:
        return True
    else:
        return False

# function to check  Fibonacci number
def isfibonaccinumber(n):
    res1 = 5 * n * n + 4
    res2 = 5 * n * n - 4
    if checkperfectsquare(res1) or checkperfectsquare(res2):
        return True
    else:
        return False

number = int(input())

answer = []

for i in range(1, number + 1):
    if isfibonaccinumber(i):
        answer.append('O')
    else:
        answer.append('o')

print(''.join(answer))