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[50][50];
int n;
void init() {
  for (int i = 1; i <= n / 2 + 1; i++) {
    for (int j = 1; j <= n / 2 + 1; j++) {
      if (n / 2 + 1 - j < i) {
        ans[i][j] = ans[i][(n / 2 + 1) * 2 - j] = 1;
      }
    }
  }
  for (int i = n / 2 + 1; i <= n; i++) {
    for (int j = 1; j <= n / 2 + 1; j++) {
      if (j >= i - n / 2) {
        ans[i][j] = ans[i][(n / 2 + 1) * 2 - j] = 1;
      }
    }
  }
}
int main() {
  cin >> n;
  init();
  int a = 1;
  int b = 2;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (ans[i][j]) {
        cout << a << " ";
        a += 2;
      } else {
        cout << b << " ";
        b += 2;
      }
    }
    cout << endl;
  }
  return 0;
}