Algorithm

A. Eleven
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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

• f1 = 1,
• f2 = 1,
• fn = fn - 2 + fn - 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.

Input

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

Output

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

Examples
input
Copy
`8`
output
Copy
`OOOoOooO`
input
Copy
`15`
output
Copy
`OOOoOooOooooOoo`

Code Examples

#1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <bits/stdc++.h>

using namespace std;

int main() {
int f = 1, s = 1;
vector<int> fib;
fib.push_back(f);
fib.push_back(s);
while(s < 2000) {
int tmp = s;
s = f + s;
f = tmp;
fib.push_back(s);
}

int n;
cin >> n;

string res = "";
for(int i = 1; i <= n; ++i) {
if(binary_search(fib.begin(), fib.end(), i))
res += 'O';
else
res += 'o';
}

cout << res << endl;

return 0;
}``````
Copy The Code &

Input

cmd
8

Output

cmd
OOOoOooO