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 arr[50][50];
int main() {
  int n, i, j, k, p, q, val = 1;
  cin >> n;
  i = 0, j = n / 2;
  k = 1;
  while (j >= 0) {
    for (p = 0; p < k; p++) arr[i][j + p] = val, val += 2;
    ++i, --j, k += 2;
  }
  j += 2, k -= 4;
  while (i <= n) {
    for (p = 0; p < k; ++p) arr[i][j + p] = val, val += 2;
    ++i, ++j, k -= 2;
  }
  k = 2;
  for (i = 0; i < n; ++i) {
    for (j = 0; j < n; ++j) {
      if (arr[i][j] == 0) arr[i][j] = k, k += 2;
      cout << arr[i][j] << " ";
    }
    cout << endl;
  }
  return 0;
}