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 T[50][50];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int x = 1;
  int i = 0, j = n / 2;
  while (x <= n * n) {
    T[i][j] = x++;
    int i1 = (i >= 1 ? i - 1 : n - 1);
    int j1 = (j < n - 1 ? j + 1 : 0);
    if (T[i1][j1] != 0)
      i = (i < n - 1 ? i + 1 : 0);
    else
      i = i1, j = j1;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) cout << T[i][j] << " ";
    cout << "\n";
  }
  return 0;
}