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>
#pragma GCC optimize("O2")
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  long long int o = 1, e = 2, k = n / 2, x = n / 2 - 1;
  for (int(i) = (0); (i) < (n); ++(i)) {
    bool ok = 0;
    for (int(j) = (0); (j) < (n); ++(j)) {
      if (i <= k) {
        if (k - i <= j && j <= k + i) {
          cout << o << " ";
          o += 2;
          continue;
        }
        cout << e << " ";
        e += 2;
      } else {
        ok = 1;
        if (k - x <= j && j <= k + x) {
          cout << o << " ";
          o += 2;
          continue;
        }
        cout << e << " ";
        e += 2;
      }
    }
    if (ok) --x;
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  solve();
  return 0;
}