#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
vector<long long> solve(vector<long long> &a, long long b) {
  vector<long long> ans(3);
  for (int i = 0; i < a.size(); i++) {
    ans[0] += abs(b - 1 - a[i]);
    ans[1] += abs(b - a[i]);
    ans[2] += abs(b + 1 - a[i]);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m, k, q, x, a, b, c, y;
  cin >> n;
  b = n / 2;
  a = 1;
  c = 2;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (abs(i - b) + abs(j - b) <= b) {
        cout << a << ' ';
        a += 2;
      } else {
        cout << c << ' ';
        c += 2;
      }
    }
    cout << '\n';
  }
  return 0;
}
