#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int a[1000007];
int main() {
  int n, i, j, k, c, count = 0;
  cin >> n;
  if (n % 2 == 0) {
    c = n / 2;
  } else {
    c = (n - 1) / 2;
  }
  v.push_back(0);
  v.push_back(c);
  a[0] = 1;
  a[c] = 1;
  for (count = 0; count < n; count++) {
    a[c] = 1;
    if (c == 1) {
      break;
    }
    if ((c + n) % 2 == 0) {
      k = (c + n) / 2;
      if (k > n - 1 || k == c || a[k] == 1) {
        if (c % 2 == 0)
          k = c / 2;
        else
          k = (c - 1) / 2;
      }
    } else {
      k = (c + n - 1) / 2;
      if (k > n - 1 || k == c || a[k] == 1) {
        if (c % 2 == 0)
          k = c / 2;
        else
          k = (c - 1) / 2;
      }
    }
    c = k;
    v.push_back(c);
  }
  if (count != n - 2) {
    cout << -1 << endl;
    return 0;
  }
  v.push_back(0);
  for (i = v.size() - 1; i >= 0; i--) {
    cout << v[i] << " ";
  }
  cout << endl;
  return 0;
}
