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>
const int maxn = 50;
int M[maxn][maxn];
int main(int argc, char **argv) {
  int n, i, j, tmp = 1;
  scanf("%d", &n);
  memset(M, 0, sizeof(M));
  for (i = 0; i <= n >> 1; i++)
    for (j = (n >> 1) - i; j <= (n >> 1) + i; j++) {
      M[i][j] = tmp;
      tmp += 2;
    }
  for (i = 0; i < n >> 1; i++)
    for (j = (n >> 1) - i; j <= (n >> 1) + i; j++) {
      M[n - i - 1][j] = tmp;
      tmp += 2;
    }
  tmp = 2;
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++)
      if (!M[i][j]) {
        M[i][j] = tmp;
        tmp += 2;
      }
  for (i = 0; i < n; i++) {
    for (j = 0; j < n - 1; j++) printf("%d ", M[i][j]);
    printf("%d\n", M[i][n - 1]);
  }
  return 0;
}