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 o = 1, e = 2;
int odd() {
  o += 2;
  return o - 2;
}
int evan() {
  e += 2;
  return e - 2;
}
int main() {
  int n, m;
  cin >> n;
  m = (n + 1) / 2;
  int x = 0, y = m - 1, a = m + 1, b = n + m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int t1 = abs(i - j), t2 = i + j;
      if (t1 >= x && t1 <= y && t2 >= a && t2 <= b)
        cout << odd();
      else
        cout << evan();
      cout << ' ';
    }
    cout << endl;
  }
  return 0;
}