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);
  bool num[n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) num[i][j] = 0;
  for (int i = 0; i < n; i++) {
    num[i][n >> 1] = num[n >> 1][i] = 1;
  }
  int odd = n * 2 - 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (num[i][j]) continue;
      if (odd <= (n * n >> 1)) {
        num[i][j] = 1;
        num[n - i - 1][j] = 1;
        num[i][n - j - 1] = 1;
        num[n - i - 1][n - j - 1] = 1;
        odd += 4;
      }
    }
  }
  odd = -1;
  int even = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (num[i][j])
        printf("%d ", odd += 2);
      else
        printf("%d ", even += 2);
    }
    printf("\n");
  }
  return 0;
}