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;
void nineGongGe(int n) {
  int **a;
  a = new int *[n];
  for (int i = 0; i < n; ++i) a[i] = new int[n];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) a[i][j] = 0;
  int x = 0, y = n / 2;
  a[x][y] = 1;
  for (int i = 2; i <= n * n; ++i) {
    int xNew = x - 1;
    int yNew = y + 1;
    if (yNew > n - 1) yNew = 0;
    if (xNew < 0) xNew = n - 1;
    if (a[xNew][yNew] != 0) {
      xNew = x + 1;
      yNew = y;
    }
    a[xNew][yNew] = i;
    x = xNew;
    y = yNew;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
}
int main() {
  int n;
  cin >> n;
  nineGongGe(n);
  return 0;
}