Eleven

题意翻译

输入n(1<=n<=1000)。 输出n个o,如果i是斐波那契数列中的数,则第i个o为大写,否则为小写。 Translated by @iMMIQ

题目描述

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. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF918A/bbc452c49c868a8765bf80560e629f0cebfdfc80.png)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.

输入输出格式

输入格式


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

输出格式


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

输入输出样例

输入样例 #1

8

输出样例 #1

OOOoOooO

输入样例 #2

15

输出样例 #2

OOOoOooOooooOoo