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, l, r, odd, row = 0, even = 0, f[50][50];
  cin >> n;
  l = n / 2 + 1;
  r = n / 2 + 1;
  odd = -1;
  memset(f, 0, sizeof(f));
  while (r <= n) {
    ++row;
    for (int i = l; i <= r; i++) {
      odd += 2;
      f[row][i] = odd;
    }
    --l;
    ++r;
  }
  ++l;
  --r;
  while (l <= r) {
    ++l;
    --r;
    if (l > r) break;
    ++row;
    for (int i = l; i <= r; i++) {
      odd += 2;
      f[row][i] = odd;
    }
  }
  even = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      if (f[i][j] == 0) {
        even += 2;
        f[i][j] = even;
      }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      if (j < n)
        cout << f[i][j] << ' ';
      else
        cout << f[i][j] << endl;
  }
}