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 n, m[50][50], o = 1, e = 2;
int main() {
  scanf("%d", &n), memset(m, 0, sizeof m);
  for (int i = 0, j = (n + 1) / 2; i < j; ++i)
    for (int k = n / 2 - i, l = 0, s = 2 * i + 1; l < s; ++l)
      m[i][k + l] = o, o += 2;
  for (int i = (n + 1) / 2; i < n; ++i)
    for (int j = (i - (n - 1) / 2), k = n - j - 1; j <= k; ++j)
      m[i][j] = o, o += 2;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j)
      if (m[i][j] == 0) m[i][j] = e, e += 2;
  for (int i = 0; i < n; ++i, puts("")) {
    printf("%d", m[i][0]);
    for (int j = 1; j < n; ++j) printf(" %d", m[i][j]);
  }
}