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() {
  int n;
  cin >> n;
  int odd = 1, even = 2;
  for (int i = 1; i <= n; i++) {
    if (i == (n / 2) + 1) {
      for (int j = 1; j <= n; j++) {
        cout << odd << " ";
        odd += 2;
      }
      cout << endl;
    } else if (i < (n / 2) + 1) {
      for (int j = 1; j <= n; j++) {
        if (j > (n - (i * 2 - 1)) / 2 && j <= (n - ((n - (i * 2 - 1)) / 2))) {
          cout << odd << " ";
          odd += 2;
        } else {
          cout << even << " ";
          even += 2;
        }
      }
      cout << endl;
    } else {
      int ii = ((n / 2) + 1) - (i - ((n / 2) + 1));
      for (int j = 1; j <= n; j++) {
        if (j > (n - (ii * 2 - 1)) / 2 && j <= (n - ((n - (ii * 2 - 1)) / 2))) {
          cout << odd << " ";
          odd += 2;
        } else {
          cout << even << " ";
          even += 2;
        }
      }
      cout << endl;
    }
  }
}