#include <bits/stdc++.h>
int a[100][100];
int main() {
  memset(a, 0, sizeof(a));
  int i, n, sum, j, p1 = 1, p2 = 2;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) a[n / 2 + 1][i] = a[i][n / 2 + 1] = 1;
  sum = n * n / 2 + 1 - (2 * n - 1);
  for (j = 1; j <= n / 2 && sum > 0; i = 1, j++)
    for (i = 1; i <= n / 2 && sum > 0; i++) {
      sum -= 4, a[j][i] = 1;
      a[n + 1 - j][n + 1 - i] = 1;
      a[n + 1 - j][i] = 1;
      a[j][n + 1 - i] = 1;
    }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++)
      if (a[i][j] == 1)
        printf("%d ", p1), p1 += 2;
      else
        printf("%d ", p2), p2 += 2;
    printf("\n");
  }
  return 0;
}
