#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> p(n), q(n);
  ll x = n * (n + 1LL) / 2;
  if (x % 2 == 0) {
    x /= 2;
    for (int i = n; i >= 1; --i) {
      p[i - 1] = i * 3 - 2;
      q[i - 1] = i * 3 - 1;
      if (x >= i) {
        swap(p[i - 1], q[i - 1]);
        x -= i;
      }
    }
  } else if (n == 1) {
    cout << "-1\n";
    return 0;
  } else {
    p[n - 2] = 1;
    p[n - 1] = 4;
    q[n - 2] = 5;
    q[n - 1] = 2;
    x = (x + 12 + 5) / 2 - 2 * n;
    for (int i = n; i > 2; --i) {
      p[i - 3] = i * 3 - 2;
      q[i - 3] = i * 3 - 1;
      if (x >= i - 2) {
        swap(p[i - 3], q[i - 3]);
        x -= i - 2;
      }
    }
  }
  assert(x == 0);
  REP(i, n) cout << p[i] << ' ';
  REP(i, n) cout << (i + 1) * 3 << ' ';
  REP(i, n) cout << q[i] << " \n"[i + 1 == n];
  return 0;
}