Problem: A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll call number n the size of permutation p1, p2, ..., pn.

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 ppi = i and pi ≠ 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, p1, p2, ..., pn — permutation p, that is perfect. Separate printed numbers by whitespaces.

Examples

Input

1


Output

-1


Input

2


Output

2 1 


Input

4


Output

2 1 4 3 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n1;
  cin >> n1;
  int s[n1];
  int z = 0;
  for (int i = 1; i <= n1; i++) {
    s[z] = i;
    z++;
  }
  if (z % 2 == 0) {
    int i = 0;
    int j = 1;
    while (j <= z - 1) {
      int temp = s[i];
      s[i] = s[j];
      s[j] = temp;
      i += 2;
      j += 2;
    }
    for (int a = 0; a < z; a++) {
      cout << s[a] << " ";
    }
  } else {
    cout << -1;
  }
}