#include <bits/stdc++.h>
using namespace std;
inline int ABS(int a) {
  if (a < 0) return (-a);
  return a;
}
inline int min(int a, int b, int c) { return min(a, min(b, c)); }
inline int max(int a, int b, int c) { return max(a, max(b, c)); }
inline int powmod(int x, int n, int _mod) {
  int res = 1;
  while (n) {
    if (n & 1) res = (res * x) % _mod;
    x = (x * x) % _mod;
    n >>= 1;
  }
  return res;
}
inline int gcd(int a, int b) {
  int t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline int lcm(int a, int b) { return a / (gcd(a, b) * b); }
const int v5 = 100000;
const int v9 = 1000000000;
const int v6 = 1000000;
int n;
vector<int> v;
inline void cinarr(int x[], int n) {
  for (int i = 0; i < (n); ++i) cin >> (x[i]);
}
inline void cinvec(vector<int> &arr, int n) {
  for (int i = 0; i < (n); ++i) {
    int x;
    cin >> (x);
    arr.push_back(x);
  };
}
int b[100001], c[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> (n);
  if (n == 1) {
    cout << 0 << "\n";
    cout << 0 << "\n";
    cout << 0 << "\n";
    return 0;
  }
  if (n <= 2 || n % 2 == 0) {
    cout << -1 << "\n";
    return 0;
  }
  for (int i = (0); i < (n); ++i) {
    c[i] = n - i;
  }
  c[0] = 0;
  for (int i = (0); i < (n); ++i) {
    c[i] = (i + i) % n;
  }
  for (int i = (0); i < (n); ++i) cout << i << " ";
  cout << ""
       << "\n";
  for (int i = (0); i < (n); ++i) cout << i << " ";
  cout << ""
       << "\n";
  for (int i = (0); i < (n); ++i) cout << c[i] << " ";
  cout << ""
       << "\n";
  return 0;
}
