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;
  long long a[49][49];
  long long x = n - 1, y = (n - 1) / 2, q = 1;
  for (int j = n - 1; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
      a[j][i] = 0;
    }
  }
  a[x][y] = q;
  for (int q = 2; q <= n * n; q++) {
    if (a[(x + 1) % n][(y + 1) % n] == 0) {
      a[(x + 1) % n][(y + 1) % n] = q;
      x++;
      y++;
    } else {
      a[(x - 1) % n][(y) % n] = q;
      x--;
    }
  }
  for (int j = n - 1; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
      cout << a[j][i] << " ";
    }
    cout << endl;
  }
  return 0;
}