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>
#pragma GCC optimize("O2")
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  long long int e = 2, o = 1, l = 0, r = 0;
  l = (n / 2) + 1;
  r = l;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (j >= l && j <= r) {
        cout << o << " ";
        o += 2;
      } else {
        cout << e << " ";
        e += 2;
      }
    }
    cout << "\n";
    if (i < (n / 2) + 1) {
      l -= 1;
      r += 1;
    } else {
      l += 1;
      r -= 1;
    }
  }
}