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 main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  scanf("%d", &n);
  int e = 2, o = 1, i, j;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if ((i <= n / 2 && (j >= n / 2 - i && j <= n / 2 + i)) ||
          (i > n / 2 && (j >= i - n / 2 && j <= (3 * n) / 2 - i - 1))) {
        cout << o << " ";
        o += 2;
      } else {
        cout << e << " ";
        e += 2;
      }
    }
    cout << endl;
  }
}