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