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 main() {
  int n;
  cin >> n;
  int a[n][n];
  memset(a, 0, sizeof a);
  int p = 1;
  for (int i = 0, j = n / 2; i <= n / 2; i++, j--) {
    for (int k = j; k < n - j; k++) {
      a[i][k] = p;
      p += 2;
    }
  }
  for (int i = n - 1, j = n / 2; i > n / 2; i--, j--) {
    for (int k = j; k < n - j; k++) {
      a[i][k] = p;
      p += 2;
    }
  }
  p = 2;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[i][j] == 0) {
        a[i][j] = p;
        p += 2;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << a[i][j] << ' ';
    }
    cout << endl;
  }
}