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 long long int inf = 6e18 + 10;
const long long MOD = 1e9 + 7;
const int MAX = 2e5 + 1;
const long long int N = 100 + 5;
using namespace std;
void solve() {
  int n;
  cin >> n;
  int mid = n / 2;
  vector<int> ans = {1, 2};
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      int x = abs(i - mid);
      int y = abs(j - mid);
      int temp = min(x, y) % 2;
      cout << ans[temp] << " ";
      ans[temp] += 2;
    }
    cout << endl;
  }
}
int main() {
  solve();
  return 0;
}