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 ans[51][51];
int main() {
  int N, cnt = 2;
  cin >> N;
  for (int i = 1; i <= N / 2; i++) {
    for (int j = N / 2 - i + 1; j > 0; j--) {
      ans[i][j] = cnt;
      cnt += 2;
      ans[N - i + 1][j] = cnt;
      cnt += 2;
      ans[i][N - j + 1] = cnt;
      cnt += 2;
      ans[N - i + 1][N - j + 1] = cnt;
      cnt += 2;
    }
  }
  cnt = 1;
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= N; j++) {
      if (!ans[i][j]) {
        ans[i][j] = cnt;
        cnt += 2;
      }
      cout << ans[i][j] << " ";
    }
    cout << "\n";
  }
}