#include <bits/stdc++.h>
using namespace std;
int n, st[200005], top = 0;
int son[200005][2], p[200005];
void work(int t) {
  if (p[t] > 1) return;
  if (!p[t]) {
    p[t]++;
    work(son[t][0]);
    st[++top] = 2 * t - 2;
  }
  if (p[t] == 1) {
    p[t]++;
    work(son[t][1]);
    st[++top] = 2 * t - 1;
  }
}
int main() {
  int i;
  scanf("%d", &n);
  if (n & 1) {
    printf("-1");
    return 0;
  }
  for (i = 1; i <= n / 2; i++) {
    son[i][0] = (2 * i - 2) % (n / 2) + 1;
    son[i][1] = (2 * i - 1) % (n / 2) + 1;
  }
  work(1);
  for (i = top; i >= 0; i--) printf("%d ", st[i]);
  return 0;
}
