Problem: Find an n × n matrix with different numbers from 1 to n2, so the sum in each row, column and both main diagonals are odd.

Input

The only line contains odd integer n (1 ≤ n ≤ 49).

Output

Print n lines with n integers. All the integers should be different and from 1 to n2. The sum in each row, column and both main diagonals should be odd.

Examples

Input

1


Output

1


Input

3


Output

2 1 4
3 5 7
6 9 8

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, mp[300][300];
int main() {
  cin >> n;
  int mid = n / 2 + 1;
  for (int len = 0; len <= mid - 1; ++len) {
    for (int i = 0; i <= len; i += 2)
      mp[mid + i][mid - len] = mp[mid - i][mid - len] = mp[mid + i][mid + len] =
          mp[mid - i][mid + len] = 1;
    for (int i = 0; i <= len; i += 2)
      mp[mid - len][mid + i] = mp[mid - len][mid - i] = mp[mid + len][mid + i] =
          mp[mid + len][mid - i] = 1;
  }
  int cnt1 = 1, cnt2 = 2;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (mp[i][j] & 1) {
        mp[i][j] = cnt1;
        cnt1 += 2;
      } else {
        mp[i][j] = cnt2;
        cnt2 += 2;
      }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j < n; ++j) cout << mp[i][j] << ' ';
    cout << mp[i][n] << endl;
  }
  return 0;
}