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