{"raw_statement":[{"iden":"statement","content":"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.\n\n<center>![image](https://espresso.codeforces.com/7b17e090ebd76d0a8a21e176ebd7cfb297cbc8ec.png)</center>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\n\n*   _f_1 = 1,\n*   _f_2 = 1,\n*   _f__n_ = _f__n_ - 2 + _f__n_ - 1 (_n_ > 2).\n\nAs her friends are too young to know what Fibonacci sequence is, they asked you to help Eleven determine her new name."},{"iden":"input","content":"The first and only line of input contains an integer _n_ (1 ≤ _n_ ≤ 1000)."},{"iden":"output","content":"Print Eleven's new name on the first and only line of output."},{"iden":"examples","content":"Input\n\n8\n\nOutput\n\nOOOoOooO\n\nInput\n\n15\n\nOutput\n\nOOOoOooOooooOoo"}],"translated_statement":[{"iden":"statement","content":"Eleven 想为自己选择一个新名字。作为一群极客，她的朋友们提出了一种选名算法。Eleven 希望她的名字恰好包含 #cf_span[n] 个字符。\n\n她的朋友建议，她的名字只能由大写和小写字母 '_O_' 组成。更准确地说，他们建议：如果 #cf_span[i] 属于斐波那契数列，则名字的第 #cf_span[i] 个字母应为 '_O_'（大写），否则为 '_o_'（小写）。名字中的字母编号从 #cf_span[1] 到 #cf_span[n]。斐波那契数列是序列 #cf_span[f]，其中\n\n由于她的朋友们太年轻，不知道什么是斐波那契数列，他们请你帮助 Eleven 确定她的新名字。\n\n输入的第一行也是唯一一行包含一个整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 1000]）。\n\n请在输出的第一行也是唯一一行打印 Eleven 的新名字。"},{"iden":"input","content":"输入的第一行也是唯一一行包含一个整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 1000]）。"},{"iden":"output","content":"请在输出的第一行也是唯一一行打印 Eleven 的新名字。"},{"iden":"examples","content":"输入\n8\n输出\nOOOoOooO\n输入\n15\n输出\nOOOoOooOooooOoo"}],"sample_group":[],"show_order":[],"formal_statement":"Let $ n \\in \\mathbb{N} $, $ 1 \\leq n \\leq 1000 $.\n\nDefine the Fibonacci sequence $ F = \\{ f_1, f_2, f_3, \\dots \\} $ where:\n- $ f_1 = 1 $\n- $ f_2 = 1 $\n- $ f_k = f_{k-1} + f_{k-2} $ for $ k \\geq 3 $\n\nFor each position $ i \\in \\{1, 2, \\dots, n\\} $, define the character $ c_i $ as:\n$$\nc_i =\n\\begin{cases}\n\\text{`O'} & \\text{if } i \\in F \\\\\n\\text{`o'} & \\text{otherwise}\n\\end{cases}\n$$\n\nOutput the string $ c_1 c_2 \\dots c_n $.","simple_statement":null,"has_page_source":false}