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 n, c[50][50];
int main() {
  cin >> n;
  int x = 1;
  for (int i = 1; i <= n; i++) {
    if (i == n / 2 + 1) continue;
    c[n / 2 + 1][i] = x;
    x += 2;
    c[i][n / 2 + 1] = x;
    x += 2;
  }
  c[n / 2 + 1][n / 2 + 1] = x;
  x += 2;
  for (int i = 0; i < ((n * n + 1) / 2 - 2 * n + 1) / 4; i++) {
    int a = i / (n / 2);
    int b = i % (n / 2);
    c[1 + a][1 + b] = x;
    x += 2;
    c[n - a][1 + b] = x;
    x += 2;
    c[1 + a][n - b] = x;
    x += 2;
    c[n - a][n - b] = x;
    x += 2;
  }
  x = 2;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (!c[i][j]) {
        c[i][j] = x;
        x += 2;
      }
      cout << c[i][j] << " ";
    }
    cout << "\n";
  }
}