#include <bits/stdc++.h>
using namespace std;
int v, x[50][50], n;
vector<int> vec[2];
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) ++v, vec[v & 1].push_back(v);
  for (int i = 1; i <= n; ++i) x[i][(n + 1) >> 1] = 1;
  for (int i = 1; i <= n; ++i) x[(n + 1) >> 1][i] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (x[i][j]) x[i][j] = vec[1].back(), vec[1].pop_back();
  for (int i = 1; i <= n and vec[1].size(); ++i)
    for (int j = 1; j <= n and vec[1].size(); ++j)
      if (x[i][j] == 0) {
        x[i][j] = vec[1].back(), vec[1].pop_back();
        x[n - i + 1][j] = vec[1].back(), vec[1].pop_back();
        x[i][n - j + 1] = vec[1].back(), vec[1].pop_back();
        x[n - i + 1][n - j + 1] = vec[1].back(), vec[1].pop_back();
      }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (x[i][j] == 0) x[i][j] = vec[0].back(), vec[0].pop_back();
  for (int i = 1; i <= n; ++i, cout << '\n')
    for (int j = 1; j <= n; ++j, cout << ' ') cout << x[i][j];
  return 0;
}
