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) {
  long long int a[50][50] = {0}, c, d, i, j, n;
  scanf("%lld", &n);
  c = n / 2;
  d = n - 1;
  for (i = 1; i <= n * n;) {
    if (c == -1 && d == n) {
      d = n - 2;
      c = 0;
    } else {
      if (d == n) d = 0;
      if (c < 0) c = n - 1;
    }
    if (a[c][d] != 0) {
      d = d - 2;
      c++;
      continue;
    } else {
      a[c][d] = i;
      i++;
    }
    d++;
    c--;
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) printf("%lld ", a[i][j]);
    printf("\n");
  }
  return 0;
}