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 main() {
  int n;
  cin >> n;
  int a[n + 1][n + 1];
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++) a[i][j] = -1;
  int odd_num = 1;
  int mid;
  mid = (n + 1) / 2;
  for (int i = 1; i < mid; i++) {
    for (int j = mid - i + 1; j <= mid + i - 1; j++) {
      a[i][j] = odd_num;
      odd_num += 2;
      a[n - i + 1][j] = odd_num;
      odd_num += 2;
    }
  }
  for (int i = 1; i <= n; i++) {
    a[mid][i] = odd_num;
    odd_num += 2;
  }
  int even_num = 2;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[i][j] == (-1)) {
        a[i][j] = even_num;
        even_num += 2;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << a[i][j] << " ";
    cout << "\n";
  }
  return 0;
}