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 i, j, t1, t2, dis, n;
int main() {
  scanf("%d", &n);
  t1 = 1;
  t2 = 2;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      dis = abs(i - (n + 1) / 2) + abs(j - (n + 2) / 2);
      if (dis <= n / 2)
        printf("%d ", t1), t1 += 2;
      else
        printf("%d ", t2), t2 += 2;
    }
    printf("\n");
  }
}