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