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;
long long n;
long long chan = 2, le = 1;
long long so1, so2;
long long i, j;
int main() {
  cin >> n;
  for (i = 1; i <= n / 2; i++) {
    for (so1 = n / 2 - i; so1 >= 0; so1--) {
      cout << chan << ' ';
      chan += 2;
    }
    for (so2 = 2 * i - 1; so2 >= 1; so2--) {
      cout << le << ' ';
      le += 2;
    }
    for (so1 = n / 2 - i; so1 >= 0; so1--) {
      cout << chan << ' ';
      chan += 2;
    }
    cout << endl;
  }
  for (i = n / 2 + 1; i >= 1; i--) {
    for (so1 = n / 2 - i; so1 >= 0; so1--) {
      cout << chan << ' ';
      chan += 2;
    }
    for (so2 = 2 * i - 1; so2 >= 1; so2--) {
      cout << le << ' ';
      le += 2;
    }
    for (so1 = n / 2 - i; so1 >= 0; so1--) {
      cout << chan << ' ';
      chan += 2;
    }
    cout << endl;
  }
}