#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  if (n == 1) {
    cout << -1 << '\n';
    return 0;
  }
  VI a[3];
  if (n % 4 == 1) {
    a[0] = {1,2,3,13,15};
    a[1] = {4,5,7,12,14};
    a[2] = {6,8,9,10,11};
  } else if (n % 4 == 2) {
    a[0] = {1,6};
    a[1] = {2,4};
    a[2] = {3,5};
  } else if (n % 4 == 3) {
    a[0] = {1,2,9};
    a[1] = {5,7,8};
    a[2] = {3,4,6};
  }
  int j = a[0].size();
  int v = 3 * j + 1;
  while (ssize(a[0]) < n) {
    a[1].emplace_back(v++);
    a[0].emplace_back(v++);
    a[2].emplace_back(v++);
    a[1].emplace_back(v++);
    a[2].emplace_back(v++);
    a[0].emplace_back(v++);
    a[1].emplace_back(v++);
    a[2].emplace_back(v++);
    a[0].emplace_back(v++);
    a[1].emplace_back(v++);
    a[0].emplace_back(v++);
    a[2].emplace_back(v++);
  }
  rep(i, 3) rep(j, n) cout << a[i][j] << " \n"[i == 2 && j + 1 == n];
}