A permutation is a sequence of integersp1,p2,...,pn, consisting ofn distinct positive integers, each of them doesn't exceedn. Let's denote the i-th element of permutation p aspi. We'll call numbern the size of permutation p1,p2,...,pn.
Nickolas adores permutations. He likes some permutations more than the others. He calls such permutations perfect. Aperfect permutation is such permutation p that for any i (1≤i≤n) (n is the permutation size) the following equations holdppi=i andpi≠i. Nickolas asks you to print any perfect permutation of sizen for the given n.
A single line contains a single integer n (1≤n≤100) the permutation size.
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 permutationp, that is perfect. Separate printed numbers by whitespaces.
#include"stdio.h"
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
if(n % 2)
{
printf("-1\n");
}
else
{
int i;
for(i = 1; i <= n; i++)
{
if(i % 2)
{
printf("%d", i + 1);
}
else
printf("%d", i - 1);
if(i != n)
printf(" ");
}
printf("\n");
}
}
return 0;
}