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