n = int(input())

def fib2(n):
	if n <= 1:
		return 1

	solutions = []
	solutions.append(1)
	solutions.append(1)

	i = 2
	while solutions[i - 1] + solutions[i - 2] <= n:
		solutions.append(solutions[i - 1] + solutions[i - 2])
		i = i + 1;		

	return solutions[1:]

fibs = fib2(n)

if fibs == 1:
	fibs = [1]

name = ""
for i in fibs:
	if len(name) < i - 1:
		diff = i - len(name) - 1
		name = name + "o" * diff + "O"
	else:
		name = name + "O"
if len(name) < n:
	diff = n - len(name)
	name = name + ("o" * diff)
print(name)
