9118: ABC336 —— A - Long Loong
[Creator : ]
Description
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.
You are given a positive integer $N$. Print the Dragon String of level $N$.
Note that uppercase and lowercase letters are distinguished.
Input
The input is given from Standard Input in the following format:
```
$N$
```
```
$N$
```
Output
Print the Dragon String of level $N$.
Constraints
- $1 \leq N \leq 2024$
- $N$ is an integer.
- $N$ is an integer.
Sample 1 Input
3
Sample 1 Output
Looong
Arranging one L, three os, one n, and one g in this order yields Looong.
Sample 2 Input
1
Sample 2 Output
Long