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 n, k;
int main() {
  scanf("%d", &n);
  k = n / 2;
  for (int i = 1, o = 1, e = 1, l, r; i <= n; ++i) {
    l = k + 1 - (i - 1);
    r = k + 1 + (i - 1);
    if (l <= 0) {
      l = 2 - l;
      r = 4 * k + 2 - r;
    }
    for (int j = 1; j <= n; ++j) {
      if (j < l || j > r)
        printf("%d", 2 * (e++));
      else
        printf("%d", 2 * (o++) - 1);
      if (j < n)
        printf(" ");
      else
        printf("\n");
    }
  }
  return 0;
}