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;
const int N = 50 + 5;
int n, a[N][N], tot;
int main() {
  cin >> n;
  int i = 0, j = n / 2, x, y;
  for (int k = 1; k <= n * n; k++) {
    if (a[i][j]) {
      i = (x + 1) % n;
      j = y;
    }
    a[i][j] = k;
    x = i;
    y = j;
    i = (i - 1 + n) % n;
    j = (j + 1) % n;
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) printf("%d%c", a[i][j], " \n"[j + 1 == n]);
  return 0;
}