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() {
  int m[49][49], n, i, j, num, temp;
  scanf("%d", &n);
  num = n * n;
  temp = n;
  for (i = 0; i < (n + 1) / 2; i++) {
    if (temp % 4 != 1) {
      for (j = 0 + i + 1; j < n - i; j++) {
        m[j][0 + i] = num--;
      }
      for (j = 0 + i + 1; j < n - i; j++) {
        m[n - i - 1][j] = num--;
      }
      for (j = n - i - 2; j > 0 + i - 1; j--) {
        m[j][n - i - 1] = num--;
      }
      for (j = n - i - 2; j > 0 + i - 1; j--) {
        m[0 + i][j] = num--;
      }
    } else {
      for (j = 0 + i; j < n - i; j++) {
        m[j][0 + i] = num--;
      }
      for (j = 0 + i + 1; j < n - i; j++) {
        m[n - i - 1][j] = num--;
      }
      for (j = n - i - 2; j > 0 + i - 1; j--) {
        m[j][n - i - 1] = num--;
      }
      for (j = n - i - 2; j > 0 + i; j--) {
        m[0 + i][j] = num--;
      }
    }
    temp -= 2;
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      printf("%d ", m[i][j]);
    }
    printf("\n");
  }
  return 0;
}