{"problem":{"name":"Long Loong","description":{"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. You are given a pos","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc336_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2024$\n*   $N$ is an integer.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc336_a","tags":[],"sample_group":[["3","Looong\n\nArranging one `L`, three `o`s, one `n`, and one `g` in this order yields `Looong`."],["1","Long"]],"created_at":"2026-03-03 11:01:14"}}