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, m, w, h, i, j, i1, lool1, kol, mi = 1e9, a[110][110], b[110][110], x, y;
int main() {
  cin >> n;
  x = 2;
  y = 1;
  for (i = 0; i < n; i++) {
    for (j = 1; j <= abs(n / 2 - i); j++) cout << x << " ", x += 2;
    for (j = 1; j <= abs(n - 2 * abs(n / 2 - i)); j++) cout << y << " ", y += 2;
    for (j = 1; j <= abs(n / 2 - i); j++) cout << x << " ", x += 2;
    cout << endl;
  }
  return 0;
}