A. Who Hates Abhishek?
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A permutation is a list of integers $$$a_1, a_2, \cdots, a_n$$$, consisting of $$$n$$$ distinct non-negative and non-zero integers, each of them doesn't exceed $$$n$$$.

Abhishek hates permutations. But he hates some permutations more than the others. He calls such permutations wahiyat. A wahiyat permutation is such permutation $$$a$$$ that for any $$$j$$$ $$$(1 \le j \le n)$$$ the following equations hold $$$a_{a_j} = j$$$ and $$$a_j \neq j$$$. Since you don't like what Abhishek and want to annoy him more so you need to find any permutation that is wahiyat permutation.

Input

A single line contains a single integer $$$n$$$ ($$$1 \le n \le 10^5$$$) — the permutation size.

Output

If a wahiyat permutation of size $$$n$$$ doesn't exist, print a single integer -1. Otherwise print $$$n$$$ distinct integers from 1 to $$$n$$$, $$$a_1, a_2, \cdots, a_n$$$ — permutation $$$a$$$

Examples
Input
6
Output
2 1 4 3 6 5
Input
4
Output
2 1 4 3