import sys
from math import sqrt, floor, factorial
from collections import deque, Counter
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))
def gcd(a, b):
	mini = min(a,b)
	maxi = max(a,b)
	while maxi % mini != 0:
		maxi, mini = mini, maxi%mini
	return(mini)

def solve():
	n = int(inp()); ans = ""
	a, b = 1, 1
	for i in range(1, n+1):
		if b == i:ans+="O"; t = b; b=a+b;a=t
		else:ans += "o"
	print(ans)

if __name__ == "__main__":
	solve()