测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A11489. 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.

![](/uploads/acgo/image/eb3ac1c734d80ab3_4adfb5a9e912.jpeg)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
上一题 去做题 下一题