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, a[50][50], odd = 1, even = 2;
int main() {
  cin >> n;
  int m = n / 2 + 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (m + 1 <= i + j && i + j <= n + m && m - n <= i - j &&
          i - j <= n - m) {
        a[i][j] = odd, odd += 2;
      } else {
        a[i][j] = even, even += 2;
      }
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
  return 0;
}