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>
const int INF = 2147483647;
using namespace std;
int main() {
  int x, y, n, t = 0;
  cin >> n;
  int l = n / 2 + 1, r = l, o = 1, e = 2;
  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 << endl;
    if (t == 0) {
      l--;
      r++;
    } else {
      l++;
      r--;
    }
    if (l == 0 && r == n + 1) {
      l += 2;
      r -= 2;
      t = 1;
    }
  }
  return 0;
}