def fib(limit):
    a=[1,2]
    while a[-1]<=limit:
        a.append(a[-1]+a[-2])
    return a

n=int(input())
lst=fib(n)
s=""
pos=0
for i in range(1,n+1):
    if lst[pos]==i:
        pos+=1
        s+="O"
    else:
        s+="o"
print(s)