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() {
  ios::sync_with_stdio(false);
  int n, mt[55][55] = {{0}};
  cin >> n;
  int i = n / 2, j = n - 1;
  for (int k = 1; k <= n * n;) {
    if (i == -1 && j == n) {
      i = 0;
      j = n - 2;
    } else {
      if (i == -1) {
        i = n - 1;
      }
      if (j == n) {
        j = 0;
      }
    }
    if (mt[i][j]) {
      i++;
      j -= 2;
      continue;
    } else {
      mt[i][j] = k;
      k++;
      i--;
      j++;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << mt[i][j] << " ";
    }
    cout << '\n';
  }
  return 0;
}