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, even = 0, odd = -1;
int main() {
  cin >> n;
  int l = (n / 2), r = (n / 2);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (l <= j and j <= r) {
        odd += 2;
        cout << odd << " ";
      } else {
        even += 2;
        cout << even << " ";
      }
    }
    cout << endl;
    if (i < (n / 2)) {
      l--;
      r++;
    } else {
      l++;
      r--;
    }
  }
  return 0;
}