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