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


alias Pt = Tuple!(int, "x", int, "y");
// yoko kara
Pt[] hook(int n) {
  Pt[] ps;
  int x = 1, y = 0;
  for (; cast(int)(ps.length) < 2*n - 1; ) {
    ps ~= Pt(0, y++);
    ps ~= Pt(0, y++);
    ps ~= Pt(x++, 0);
    ps ~= Pt(x++, 0);
  }
  return ps[0 .. 2*n - 1];
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      
      auto a = new int[][](N, N);
      int k;
      
      for (int w = 0; w <= N - 3; ) {
        const ps = hook(N - w);
        foreach (p; ps) a[w + p.x][w + p.y] = ++k;
        ++w;
        const qs = hook(N - w);
        foreach_reverse (q; qs) a[w + q.y][w + q.x] = ++k;
        ++w;
      }
      if (N & 1) {
        a[N - 1][N - 1] = ++k;
      } else {
        a[N - 2][N - 2] = ++k;
        a[N - 2][N - 1] = ++k;
        a[N - 1][N - 2] = ++k;
        a[N - 1][N - 1] = ++k;
      }
      
      foreach (x; 0 .. N) {
        foreach (y; 0 .. N) {
          if (y) write(" ");
          write(a[x][y]);
        }
        writeln;
      }
    }
  } catch (EOFException e) {
  }
}