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 n;
bool inside(int x, int y) {
  int h = n / 2;
  x -= h;
  y -= h;
  if (y <= -x + h && y >= -x - h && y >= x - h && y <= x + h) return true;
  return false;
}
int main() {
  cin >> n;
  vector<vector<int> > m(n, vector<int>(n, 0));
  int oc = 1;
  int ec = 2;
  for (int y = 0; y < n; y++)
    for (int x = 0; x < n; x++)
      if (inside(x, y)) {
        m[x][y] = oc;
        oc += 2;
      } else {
        m[x][y] = ec;
        ec += 2;
      }
  for (int y = 0; y < n; y++) {
    for (int x = 0; x < n; x++) cout << m[x][y] << " ";
    cout << endl;
  }
  return 0;
}