#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1000000000000000000LL;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T k) {
  return k >= 0 ? k : -k;
}
template <class T>
T sqr(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111111;
int test;
int n, m, k, ans;
int a[N], b[N];
int main() {
  scanf("%d", &n);
  if (n % 2 == 0)
    printf("-1\n");
  else {
    for (int i = 0; i < n - 1; i++) printf("%d ", i);
    printf("%d\n", n - 1);
    k = n / 2;
    m = 2 * k - 1;
    for (int i = 0; i < k; i++) a[i] = m, b[i] = (m + i) % n, m -= 2;
    m = 2 * k;
    for (int i = k; i <= 2 * k; i++) a[i] = m, b[i] = (m + i) % n, m -= 2;
    for (int i = 0; i < n - 1; i++) printf("%d ", a[i]);
    printf("%d\n", a[n - 1]);
    for (int i = 0; i < n - 1; i++) printf("%d ", b[i]);
    printf("%d\n", b[n - 1]);
  }
  return 0;
}
