#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n;
int fa[maxn][maxn];
int main() {
  while (scanf("%d", &n) != EOF) {
    memset(fa, 0, sizeof(fa));
    int hang = 1;
    int lie = n / 2 + 1;
    int num = 1;
    while (1) {
      if (fa[hang][lie] == 0) {
        fa[hang][lie] = num++;
      }
      if (num == (n * n + 1)) break;
      int i = hang - 1;
      int j = lie + 1;
      if (i == 0) i = n;
      if (j == n + 1) j = 1;
      if (fa[i][j] == 0) {
        hang = i;
        lie = j;
      } else
        hang++;
    }
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++)
        if (j != n)
          printf("%d ", fa[i][j]);
        else
          printf("%d\n", fa[i][j]);
  }
  return 0;
}
