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>
int main(void) {
  int n;
  scanf("%d", &n);
  int solution_matrix[n][n];
  int some_other_matrix[n][n];
  int odd = 1;
  int even = 2;
  int i, j;
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j) some_other_matrix[i][j] = 1;
  for (i = 0; i < n; ++i)
    for (j = abs(i + 1 - (n + 1) / 2); j < n - abs(i + 1 - (n + 1) / 2); ++j) {
      solution_matrix[i][j] = odd;
      odd += 2;
      some_other_matrix[i][j] = 0;
    }
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j)
      if (some_other_matrix[i][j]) {
        solution_matrix[i][j] = even;
        even += 2;
      }
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j) {
      printf("%d ", solution_matrix[i][j]);
      if (j + 1 == n) putchar('\n');
    }
  return 0;
}