n=int(input())

term = [0]*1001
def fib(n):
  if n <= 2:
    return 1
  if term[n] != 0:
    return term[n]
  else:
    term[n] = fib(n - 1) + fib(n - 2)
    return term[n]
fibx=[]
temp=0
i=0
while(temp<n):
    i=i+1
    temp=fib(i)
    fibx.append(temp)


ans=[]
for i in range(1,n+1):
    if i in fibx:
        ans.append("O")
    else:
        ans.append("o")
print(''.join(ans))



