**Time limit:**1.00 s**Memory limit:**512 MB

**Input**

The only input line has an integer $n$.

**Output**

Print $n$ integers: the removal order.

**Constraints**

- $1 \le n \le 2 \cdot 10^5$

**Example**

Input:

`7`

Output:

`2 4 6 1 5 3 7`

**Time limit:**1.00 s**Memory limit:**512 MB

The only input line has an integer $n$.

Print $n$ integers: the removal order.

- $1 \le n \le 2 \cdot 10^5$

Input:

`7`

Output:

`2 4 6 1 5 3 7`