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() {
  ios_base::sync_with_stdio(0);
  int n, i, j, k, l, ctr;
  cin >> n;
  if (n == 1) {
    cout << "1\n";
    return 0;
  }
  k = 2;
  l = 1;
  for (i = 0; i < n; i++) {
    ctr = abs(n / 2 - i);
    for (j = 0; j < ctr; j++) {
      cout << k << " ";
      k += 2;
    }
    ctr = n - 2 * ctr;
    for (j = 0; j < ctr; j++) {
      cout << l << " ";
      l += 2;
    }
    ctr = abs(n / 2 - i);
    for (j = 0; j < ctr; j++) {
      cout << k << " ";
      k += 2;
    }
    cout << endl;
  }
  return 0;
}