#include <bits/stdc++.h>
using namespace std;
template <class T>
void splitstr(const string &s, vector<T> &out) {
  istringstream in(s);
  out.clear();
  copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
static void redirect(int argc, const char **argv) {
  if (argc > 1) {
    static filebuf f;
    f.open(argv[1], ios::in);
    cin.rdbuf(&f);
    if (!cin) {
      cerr << "Failed to open '" << argv[1] << "'" << endl;
      exit(1);
    }
  }
  if (argc > 2) {
    static filebuf f;
    f.open(argv[2], ios::out | ios::trunc);
    cout.rdbuf(&f);
    if (!cout) {
      cerr << "Failed to open '" << argv[2] << "'" << endl;
    }
  }
}
static void euler(vector<vector<pair<int, int> > > &edges, int cur,
                  vector<int> &out) {
  int last = -1;
  for (int i = 0; i < ((int)(edges[cur]).size()); i++) {
    pair<int, int> &e = edges[cur][i];
    if (e.first != -1) {
      last = e.first;
      e.first = -1;
      euler(edges, e.second, out);
      out.push_back(last);
    }
  }
}
int main(int argc, const char **argv) {
  redirect(argc, argv);
  int N;
  cin >> N;
  if (N & 1) {
    cout << "-1\n";
  } else {
    int M = N / 2;
    vector<vector<pair<int, int> > > edges(M);
    for (int i = 0; i < M; i++) {
      if (i != 0) edges[i].push_back(pair<int, int>(2 * i, 2 * i % M));
      edges[i].push_back(pair<int, int>(2 * i + 1, (2 * i + 1) % M));
    }
    vector<int> order;
    euler(edges, 0, order);
    reverse((order).begin(), (order).end());
    cout << "0";
    for (int i = 0; i < ((int)(order).size()); i++) cout << ' ' << order[i];
    cout << " 0\n";
  }
  return 0;
}
