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 solve(const(int) N) {
  auto ans = new int[][](2 * N - 1, N);
  foreach (y; 0 .. N) {
    foreach (x; 0 .. 2 * N - 1) {
      ans[x][y] = (x < y) ? y : (2 * N - 1 - y);
    }
    if (y & 1) {
      for (int x = 0; x < (2 * N - 1) - 1 - x; ++x) {
        swap(ans[x][y], ans[(2 * N - 1) - 1 - x][y]);
      }
    }
  }
  
  writeln(2 * N - 1);
  foreach (x; 0 .. 2 * N - 1) {
    foreach (y; 0 .. N) {
      if (y) write(" ");
      write(ans[x][y]);
    }
    writeln;
  }
  
  foreach (x; 0 .. 2 * N - 1) {
    ans[x].sort;
    foreach (y; 0 .. N - 1) {
      assert(ans[x][y] < ans[x][y + 1]);
    }
  }
  ans.sort;
  foreach (x; 0 .. (2 * N - 1) - 2) {
    assert(!(ans[x] == ans[x + 1] && ans[x + 1] == ans[x + 2]));
  }
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      solve(N);
    }
  } catch (EOFException e) {
  }
}