CF918A.Eleven

Eleven wants to choose a new name for herself. As a bunch of geeks, her friends suggested an algorithm to choose a name for her. Eleven wants her name to have exactly n characters.

Her friend suggested that her name should only consist of uppercase and lowercase letters 'O'. More precisely, they suggested that the i-th letter of her name should be 'O' (uppercase) if i is a member of Fibonacci sequence, and 'o' (lowercase) otherwise. The letters in the name are numbered from 1 to n. Fibonacci sequence is the sequence f where

• _f_1 = 1,
• _f_2 = 1,
• f__n = f__n - 2 + f__n - 1 (n > 2).

As her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name.

Eleven 想要为自己选择一个新名字。作为一群极客，她的朋友们为她提出了一种生成名字的算法。Eleven 希望她的名字恰好由 $n$ 个字符组成。

她的朋友建议：名字中只能包含大写和小写的字母 'O'。更准确地说，他们建议：名字中第 $i$ 个字母应为 'O'（大写），当且仅当 $i$ 属于斐波那契数列；否则为 'o'（小写）。名字中的字母位置编号从 $1$ 到 $n$。斐波那契数列 $f$ 定义如下：

• $f_1 = 1$，
• $f_2 = 1$，
• $f_n = f_{n-2} + f_{n-1}$（当 $n > 2$ 时）。

由于她的朋友们年纪太小，还不知道什么是斐波那契数列，因此他们请你帮忙，帮 Eleven 确定她的新名字。

The first and only line of input contains an integer n (1 ≤ n ≤ 1000).

输入仅包含一行，其中有一个整数 $n$（$1 ≤ n ≤ 1000$）。

Print Eleven's new name on the first and only line of output.

在输出的第一行且唯一一行中打印Eleven的新名字。