CodeForces 233A

CodeForces 233A

Crawling in process... Crawling failed Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice     

Description

A permutation is a sequence of integers p₁, p₂, ..., p_n, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as p_i. We'll call number n the size of permutation p₁, p₂, ..., p_n.

Nickolas adores permutations. He likes some permutations more than the others. He calls such permutations perfect. A perfect permutation is such permutation p that for any i(1 ≤ i ≤ n) (n is the permutation size) the following equations hold p_pi = i and p_i ≠ i. Nickolas asks you to print any perfect permutation of size n for the given n.

Input

A single line contains a single integer n (1 ≤ n ≤ 100) — the permutation size.

Output

If a perfect permutation of size n doesn't exist, print a single integer -1. Otherwise print n distinct integers from 1 to n, p₁, p₂, ..., p_n — permutation p, that is perfect. Separate printed numbers by whitespaces.

Sample Input

Input

1

Output

-1

Input

2

Output

2 1 

Input

4

Output

2 1 4 3 

为什么我总是做水题！！！

水平有限啊！Orz。。

大致题意，输入一个数，奇数出 -1  偶数颠倒就OK了，输入4，第一个和第二个颠倒，第三个和第四个颠倒。。依次类推

哎，没什么好说的。

#include <iostream>

using namespace std;

int main()
{
    int i;
    int n;
    cin>>n;
    if(n%2 == 1)
        cout<<"-1";
    else
    {
        for(i=1;i<=n;i++)
        {
            if(i%2 == 0)
                cout<<i-1<<" ";
            else
                cout<<i+1<<" ";
        }
    }
    return 0;
}