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 A[55][55];
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  int odd = 1;
  for (int i = 0; i < n; i++) {
    int y = (i <= n / 2 ? 2 * i + 1 : 2 * (n - i) - 1);
    int start = (i <= n / 2 ? n / 2 - i : i - n / 2);
    for (int j = 0; j < y; j++) {
      A[i][start] = odd;
      odd += 2;
      start++;
    }
  }
  int even = 2;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (A[i][j] == 0) {
        A[i][j] = even;
        even += 2;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << A[i][j] << ' ';
    }
    cout << endl;
  }
  return 0;
}