#include <cstdio>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

vector<vector<int>> solve1(int n) {
  vector<vector<int>> res(n, vector<int>(n));
  int i = 0, j = n / 2;
  for(int k : range(n*n)) {
    res[i][j] = k + 1;
    int ni = (i - 1 + n) % n;
    int nj = (j + 1) % n;
    if(res[ni][nj] > 0) {
      ni = (i + 1) % n;
      nj = j;
    }
    i = ni, j = nj;
  }
  return res;
}

vector<vector<int>> solve2(int n) {
  vector<vector<int>> res(n, vector<int>(n));
  for(int k : range(n*n)) {
    int i = k / n;
    int j = k % n;
    if((i + j) % 4 == 3 || (i - j) % 4 == 0) {
      res[i][j] = k + 1;
    } else {
      res[n-1-i][n-1-j] = k + 1;
    }
  }
  return res;
}

// (ΦωΦ)＜関孝和の方法
vector<vector<int>> solve3(int n) {
  int n2 = n - 2;
  vector<vector<int>> res(n, vector<int>(n));
  vector<vector<int>> inner = solve2(n2);
  for(int i : range(n2)) {
    for(int j : range(n2)) {
      res[i+1][j+1] = inner[i][j] + 2*n - 2;
    }
  }
  for(int k : range(n2)) {
    res[n-1][k+2] = k + 1;
    res[n-1-k][0] = n2 + k + 1;
  }
  res[n-1][1] = 2 * n2 + 1;
  res[1][0] = 2 * n2 + 2;
  for(int k : range(n)) {
    int target = (k==0||k==n-1) ? res[n-1][n-1-k] : res[n-1][k];
    res[0][k] = n*n+1 - target;
  }
  for(int k : range(1, n)) {
    int target = (k==n-1) ? res[0][0] : res[k][0];
    res[k][n-1] = n*n+1 - target;
  }
  swap(res[0][1], res[n-1][1]);
  for(int j : range(2, n-1)) {
    if((j-2)%4 < 2) { swap(res[0][j], res[n-1][j]); }
  }
  for(int i : range(1, n-1)) {
    if(i%4 < 2) { swap(res[i][0], res[i][n-1]); }
  }
  return res;
}

// (ΦωΦ)＜LUX
vector<vector<int>> solve4(int n) {
  int half = n / 2;
  int quo = half / 2;
  vector<vector<int>> small = solve1(half);
  vector<vector<int>> L = {{4, 1}, {2, 3}},
                      U = {{1, 4}, {2, 3}},
                      X = {{1, 4}, {3, 2}};
  vector<vector<vector<vector<int>>>> add(half, vector<vector<vector<int>>>(half, vector<vector<int>>(2, vector<int>(2))));
  for(int i : range(half)) {
    vector<vector<int>> target;
    if(i < quo+1) { target = L; }
    else if(i == quo+1) { target = U; }
    else { target = X; }
    for(int j : range(half)) { add[i][j] = target; }
  }
  swap(add[quo][quo], add[quo+1][quo]);
  vector<vector<int>> res(n, vector<int>(n));
  for(int i : range(half)) {
    for(int j : range(half)) {
      int x = (small[i][j] - 1) * 4;
      res[2*i]  [2*j]   = x + add[i][j][0][0];
      res[2*i]  [2*j+1] = x + add[i][j][0][1];
      res[2*i+1][2*j]   = x + add[i][j][1][0];
      res[2*i+1][2*j+1] = x + add[i][j][1][1];
    }
  }
  return res;
}

int main(void) {
  int n; scanf("%d", &n);
  vector<vector<int>> res;
  if(n & 1) {
    res = solve1(n);
  } else if(n % 4 == 0) {
    res = solve2(n);
  } else {
//    res = solve3(n);
    res = solve4(n);
  }
  for(int i : range(n)) {
    for(int j : range(n)) {
      printf("%d%c", res[i][j], j==n-1?'\n':' ');
    }
  }
  return 0;
}