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 even = 2, odd = 1;
  for (int i = 0; i < n / 2; i++) {
    for (int j = 0; j < n / 2 - i; j++) {
      cout << even << ' ';
      even += 2;
    }
    for (int j = 0; j < n - n / 2 - n / 2 + 2 * i; j++) {
      cout << odd << ' ';
      odd += 2;
    }
    for (int j = 0; j < n / 2 - i; j++) {
      if (j > 0) cout << ' ';
      cout << even;
      even += 2;
    }
    cout << endl;
  }
  for (int i = 0; i < n; i++) {
    if (i > 0) cout << ' ';
    cout << odd;
    odd += 2;
  }
  cout << endl;
  for (int i = n / 2 - 1; i > -1; i--) {
    for (int j = 0; j < n / 2 - i; j++) {
      cout << even << ' ';
      even += 2;
    }
    for (int j = 0; j < n - n / 2 - n / 2 + 2 * i; j++) {
      cout << odd << ' ';
      odd += 2;
    }
    for (int j = 0; j < n / 2 - i; j++) {
      if (j > 0) cout << ' ';
      cout << even;
      even += 2;
    }
    cout << endl;
  }
  return 0;
}