#include <cstdio>
#include <algorithm>
using namespace std;
int n, m;
int a[100100];
int b[100100];
int c[100100];
int f[100100];
int main () {
	scanf("%d", &n);
	if (!(n % 2) || n == 1) {
		printf("-1");
		return 0;
	}
	for (int i = 0; i < n; i++) {
		a[i] = i;
		//b[i] = i;
	}
	/*do {
		int fl = 0;
		for (int i = 0; i < n; i++) {
			c[i] = (a[i] + b[i]) % n;
			f[c[i]]++;
			if (f[c[i]] > 1) {
				fl = 1;
				break;
			}
		}
		if (!fl) {
			for (int i = 0; i < n; i++) {
				printf("%d ", b[i]);
			}
			printf("\n");
			break;
		}
	} while ( std::next_permutation(b, b + n) );*/

	int k = 0;
	int ind = n - 1;
	while (1) {
		b[ind] = k++;
		ind += 2;
		ind = ind % n;
		if (k == n) {
			break;
		}
	}
	for (int i = 0; i < n; i++) {
		printf("%d ", a[i]);
	}
	printf("\n");
	for (int i = 0; i < n; i++) {
		printf("%d ", b[i]);
	}
	printf("\n");
	for (int i = 0; i < n; i++) {
		c[i] = a[i] + b[i];
		c[i] = c[i] % n;
		printf("%d ", c[i]);
	}
	return 0;
}