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; }
real readReal() { return readToken.to!real; }

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)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      
      auto A = new int[N];
      auto B = new int[N];
      if (N == 5) {
        A = [3, 7, 99, 824, 4353];
        B = [0, 1, 123, 4567, 0];
        B[4] = A.sum - B.sum;
        B.sort;
      } else if (N % 3 == 2) {
        foreach (i; 0 .. N) {
          A[i] = 3 * i + 0;
          B[i] = 3 * i + 2;
        }
        const c = (N / 4 - 1) / 3 * 3;
        A[N - 8 .. N - 2] += c;
        A[N - 2 .. N] += N - 3 * c;
        A.sort;
      } else {
        foreach (i; 0 .. N) {
          A[i] = 3 * i + 0;
          B[i] = 3 * i + 1;
        }
        const c = N / 3 / 3 * 3;
        A[N - 3 .. N - 1] += c;
        A[N - 1 .. N] += N - 2 * c;
      }
      
      foreach (i; 0 .. N) { if (i) { write(" "); } write(A[i]); } writeln;
      foreach (i; 0 .. N) { if (i) { write(" "); } write(B[i]); } writeln;
      
      assert(0 <= A[0]); assert(A[N - 1] <= 10000);
      assert(0 <= B[0]); assert(B[N - 1] <= 10000);
      foreach (i; 0 .. N - 1) assert(A[i] < A[i + 1]);
      foreach (i; 0 .. N - 1) assert(B[i] < B[i + 1]);
      assert(A.sum == B.sum);
      auto appA = new bool[20001];
      auto appB = new bool[20001];
      foreach (i; 0 .. N) foreach (j; 0 .. N) appA[A[i] + A[j]] = true;
      foreach (i; 0 .. N) foreach (j; 0 .. N) appB[B[i] + B[j]] = true;
      foreach (x; 0 .. 20001) {
        assert(!(appA[x] && appB[x]));
      }
    }
  } catch (EOFException e) {
  }
}