1. Seats on the "Lastochka" Train
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The seat numbering in a new "Lastochka" train carriage is shown in the diagram below:

$$$\fbox{ 1 }$$$ $$$\fbox{ 5 }$$$$$$\fbox{13}$$$ $$$\fbox{17}$$$$$$\fbox{25}$$$ $$$\fbox{29}$$$...
$$$\fbox{ 2 }$$$ $$$\fbox{ 6 }$$$$$$\fbox{14}$$$ $$$\fbox{18}$$$$$$\fbox{26}$$$ $$$\fbox{30}$$$...
$$$\fbox{ 4 }$$$ $$$\fbox{ 8 }$$$$$$\fbox{16}$$$ $$$\fbox{20}$$$$$$\fbox{28}$$$ $$$\fbox{32}$$$...
aisle
$$$\fbox{10}$$$ $$$\fbox{12}$$$$$$\fbox{22}$$$ $$$\fbox{24}$$$$$$\fbox{34}$$$ $$$\fbox{36}$$$...
$$$\fbox{ 9 }$$$ $$$\fbox{11}$$$$$$\fbox{21}$$$ $$$\fbox{23}$$$$$$\fbox{33}$$$ $$$\fbox{35}$$$...

According to the diagram, there are blocks of 6 seats on one side of the aisle, and blocks of 4 seats on the other. All odd-numbered seats are located along the carriage walls (by the windows). Note that some seat numbers do not exist—for example, seats 3, 7, 15, 19, etc., are missing. The pattern for the subsequent numbering can be deduced from the diagram.

Vasya has purchased a ticket for seat number $$$x$$$. List the other seats in the same box as seat $$$x$$$ such that Petya ends up sitting next to Vasya.

Input

A single integer $$$x$$$ is provided — the number of Vasya's seat ($$$1 \leq x \leq 10^9$$$).

Output

Output several integers — all other seat numbers located in the same box as seat $$$x$$$. The numbers must be printed in ascending order. If Vasya made a mistake when telling the number to Petya, and a seat with number $$$x$$$ does not exist, then output -1.

Scoring

Solutions that work for $$$x \le 36$$$ will be awarded 50 points.

Examples
Input
6
Output
1 2 4 5 8 
Input
21
Output
22 23 24 
Input
3
Output
-1