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;
const int Maxn = 2500;
int n;
vector<int> o, e;
int main() {
  cin >> n;
  for (int i = 1; i <= n * n; i += 2) o.push_back(i);
  for (int i = 2; i <= n * n; i += 2) e.push_back(i);
  for (int i = 0; i <= n / 2; i++) {
    int a = (n - (2 * i + 1)) / 2;
    for (int j = 0; j < a; j++) {
      cout << e.back() << " ";
      e.pop_back();
    }
    for (int j = 0; j < 2 * i + 1; j++) {
      cout << o.back() << " ";
      o.pop_back();
    }
    for (int j = 0; j < a; j++) {
      cout << e.back() << " ";
      e.pop_back();
    }
    cout << endl;
  }
  for (int i = n / 2 - 1; i >= 0; i--) {
    int a = (n - (2 * i + 1)) / 2;
    for (int j = 0; j < a; j++) {
      cout << e.back() << " ";
      e.pop_back();
    }
    for (int j = 0; j < 2 * i + 1; j++) {
      cout << o.back() << " ";
      o.pop_back();
    }
    for (int j = 0; j < a; j++) {
      cout << e.back() << " ";
      e.pop_back();
    }
    cout << endl;
  }
  return 0;
}