def f(n):
    prev_prev = 1
    prev = 1
    if n == 1:
        return [1]
    if n == 2:
        return [1, 1]
    l = [1, 1]
    while prev + prev_prev <= n:
        l.append(prev + prev_prev)
        k = prev_prev
        prev_prev = prev
        prev = k + prev_prev
    return l



def main_function():
    output_list = []
    t = int(input())
    output_str = ""
    l = f(t)
    j = [0 for i in range(t)]
    for i in l:
        j[i - 1] = 1
    for i in j:
        if i == 0:
            output_str += "o"
        else:
            output_str += "O"
    return output_str

print(main_function())
