Long Loong

AtCoder

IDabc336_a

Time2000ms

Memory256MB

Difficulty—

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 positive integer $N$. Print the Dragon String of level $N$. Note that uppercase and lowercase letters are distinguished. ## Constraints * $1 \leq N \leq 2024$ * $N$ is an integer. ## Input The input is given from Standard Input in the following format: $N$ [samples]

Samples

Input #1

Output #1

Looong

Arranging one `L`, three `o`s, one `n`, and one `g` in this order yields `Looong`.

Input #2

Output #2

Long

API Response (JSON)

{
  "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 pos...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments