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>
using namespace std;
int a[60][60];
int main() {
  int n, i, j, r = 0, z = 2, k = 1, t;
  scanf("%d", &n);
  t = n / 2;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++)
      if (j <= t || j > n - t) {
        printf("%d ", z);
        z += 2;
      } else {
        printf("%d ", k);
        k += 2;
      }
    if (t == 0 || r == 1) {
      t++;
      r = 1;
    } else
      t--;
    printf("\n");
  }
  return 0;
}