{"raw_statement":[{"iden":"problem statement","content":"For a positive integer $X$, the **Dragon String** of level $X$ is a string of length $(X+3)$ formed by one `L`, $X$ occurrences of `o`, one `n`, and one `g` arranged in this order.\nYou are given a positive integer $N$. Print the Dragon String of level $N$.  \nNote that uppercase and lowercase letters are distinguished."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2024$\n*   $N$ is an integer."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"Looong\n\nArranging one `L`, three `o`s, one `n`, and one `g` in this order yields `Looong`."},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"Long"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}