from __future__ import division
import sys
from bisect import bisect_right as br
from bisect import bisect_left as bl
from math import ceil
t = input()
ar = [1,1]
def fib(n):
	while n >=  2:
		ar.append(ar[-1]+ar[-2])
		n -=1 
fib(t)
se = set(ar)
sn = ''
for i in range(0, t):
	if i+1 in se:
		sn+= 'O'
	else:
		sn += 'o'		 
print sn
		
