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, i, j, mid, even, odd;
int mat[55][55];
int main() {
  scanf("%d", &n);
  mid = (n + 1) / 2;
  mat[mid][mid] = 1;
  for (i = 1; mid - i > 0; i++)
    for (j = -i + 1; j <= i - 1; j++)
      mat[mid - i][mid + j] = mat[mid + i][mid + j] = 1;
  for (i = 1; i <= n; i++) mat[mid][i] = 1;
  even = 2;
  odd = 1;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (mat[i][j] == 0) {
        mat[i][j] = even;
        even += 2;
      } else {
        mat[i][j] = odd;
        odd += 2;
      }
      printf("%d ", mat[i][j]);
    }
    printf("\n");
  }
  return 0;
}