import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int[] solve(int N) { if (N == 1) return null; int[] as, bs; final switch (N % 4) { case 2: { as = [1, 4]; bs = [5, 2]; } break; case 3: { as = [1, 2, 8]; bs = [7, 5, 4]; } break; case 0: { as = [1, 2, 5, 11]; bs = [10, 7, 8, 4]; } break; case 1: { as = [1, 2, 4, 8, 14]; bs = [13, 10, 11, 7, 5]; } break; } int n = cast(int)(as.length); for (; n < N; n += 2) { as ~= [3 * n + 1, 3 * n + 5, 3 * n + 7, 3 * n + 11]; bs ~= [3 * n + 2, 3 * n + 4, 3 * n + 8, 3 * n + 10]; } int[] ans; ans ~= as; foreach (i; 1 .. N + 1) ans ~= 3 * i; ans ~= bs; return ans; } void main() { debug {{ foreach (n; 1 .. 5 + 1) { int[] xs; foreach (x; 1 .. 3 * n + 1) if (x % 3 != 0) xs ~= x; do { int sum; foreach (i; 0 .. n) sum += (i + 1) * (xs[i] - xs[n + i]); if (sum == 0) { writeln(xs); break; } } while (xs.nextPermutation); } }} try { for (; ; ) { const N = readInt; const ans = solve(N); if (ans) { foreach (i; 0 .. 3 * N) { if (i) write(" "); write(ans[i]); } writeln; } else { writeln(-1); } } } catch (EOFException e) { } }