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;
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  int o = 1, e = 2;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int h = min(j, n - j - 1);
      int d = abs(n / 2 - i);
      if (d <= h)
        cout << o, o += 2;
      else
        cout << e, e += 2;
      cout << ' ';
    }
    cout << '\n';
  }
}