#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long a[49][49];
  long long x = n - 1, y = (n - 1) / 2, q = 1;
  for (int j = n - 1; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
      a[j][i] = 0;
    }
  }
  a[x][y] = q;
  for (int q = 2; q <= n * n; q++) {
    if (a[(x + 1) % n][(y + 1) % n] == 0) {
      a[(x + 1) % n][(y + 1) % n] = q;
      x++;
      y++;
    } else {
      a[(x - 1) % n][(y) % n] = q;
      x--;
    }
  }
  for (int j = n - 1; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
      cout << a[j][i] << " ";
    }
    cout << endl;
  }
  return 0;
}
