#include <bits/stdc++.h>
using namespace std;
const int maxn = 59;
int n;
int G[maxn][maxn];
int main() {
  while (~scanf("%d", &n)) {
    memset((G), 0, sizeof(G));
    int i = 0, j = (n - 1) / 2;
    for (int k = (1); k < (n * n + 1); k++) {
      G[i][j] = k;
      if (k % n == 0) {
        i++;
        continue;
      }
      i--;
      j++;
      if (i == -1)
        i += n;
      else if (j > n - 1)
        j -= n;
    }
    for (int i = 0; i < (n); i++) {
      for (int j = 0; j < (n); j++) printf("%d ", G[i][j]);
      printf("\n");
    }
  }
}
