q=lambda:map(int,input().split())
qi=lambda:int(input())
qs=lambda:input().split()
n=qi()
def fibonacci(max):
    a, b = 1, 1
    while a <= max:
        yield a
        a, b = b, a+b

print(*['O' if i in [x for x in fibonacci(n)] else 'o' for i in range(1,n+1)],sep='')