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>
int map[55][55];
int n, m, x, y, half, p;
int main() {
  scanf("%d", &n);
  half = p = (1 + n) / 2;
  x = 2;
  y = 1;
  for (int i = 1; i <= half; i++)
    for (int j = half - i + 1; j <= half + i - 1; j++) {
      map[i][j] = y;
      y += 2;
    }
  for (int i = half + 1, k = half - 1; i <= n; i++, k--)
    for (int j = half - k + 1; j <= half + k - 1; j++) {
      map[i][j] = y;
      y += 2;
    }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (!map[i][j]) {
        map[i][j] = x;
        x += 2;
      }
    }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      printf("%d ", map[i][j]);
    }
    printf("\n");
  }
  return 0;
}