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, m, i, j, k, x = 0, y = -1, a[50][50];
  cin >> n;
  m = n / 2 + 1;
  for (i = 1; i <= n; ++i) {
    k = abs(m - i);
    for (j = 1; j <= k; ++j) a[i][j] = (x += 2);
    for (j = k + 1; j <= n - k; ++j) a[i][j] = (y += 2);
    for (j = n - k + 1; j <= n; ++j) a[i][j] = (x += 2);
  }
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= n; ++j) printf("%d ", a[i][j]);
    printf("\n");
  }
  return 0;
}