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;
using f80 = long double;
using Ptx = pair<f80, f80>;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, m, a, b;
  cin >> n;
  m = n / 2 + 1;
  a = -1;
  b = 0;
  if (n == 1) {
    cout << "1\n";
    return 0;
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (abs(m - i) + abs(m - j) <= n / 2) {
        a += 2;
        cout << a << ' ';
      } else {
        b += 2;
        cout << b << ' ';
      }
      if (j == n) cout << '\n';
    }
  return 0;
}