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