m = {}
m[1] = 1
m[2] = 1


def fibo(n):
    if n in m:
        return m[n]
    res = fibo(n - 1) + fibo(n - 2)
    m[n] = res
    return res


n = int(raw_input())

i = 3
while True:
    res = fibo(i)
    if res > 1000:
        break
    i += 1

sol = []
for i in range(1, n + 1):
    sol.append("O" if i in m.values() else "o")
print "".join(sol)
