Naming Sorting Problems

Wachil created $N$ problems about sorting. To avoid inventing a separate name for each problem, he named problem $i$ sorting i. Print the names of problems $1$ through $N$ in order. There is exactly one space between sorting and the number.

The input is given in the following format.

$N$

An integer $N$ is given.

Print $N$ lines. On line $i$, print sorting followed by one space and the integer $i$ ($1 \leq i \leq N$).

• $1 \leq N \leq 100$.
• All input numbers are integers.