def binp(x):
    l, r = -1, len(a)
    while (r - l) > 1:
        m = (l + r) // 2
        if a[m] <= x:
            l = m
        else:
            r = m
    return a[l] == x


n = int(input())
a = [1]
x = 2
while x <= n:
    a.append(x)
    x = a[-2] + a[-1]
s = ''
for i in range(n):
    if binp(i + 1):
        s += 'O'
    else:
        s += 'o'
print(s)
