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;
void cp_ms(int n) {
  int k = 0, i = 0, j = n / 2;
  int grid[n][n];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) grid[i][j] = 0;
  while (k < n * n) {
    if (grid[i][j] != 0) {
      i = (i + 2 + n) % n;
      j = (j - 1 + n) % n;
      continue;
    }
    grid[i][j] = ++k;
    i = (i - 1 + n) % n;
    j = (j + 1 + n) % n;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) printf("%d ", grid[i][j]);
    printf("\n");
  }
}
int main(int argc, const char** argv) {
  std::ios_base::sync_with_stdio(false);
  ;
  int n;
  cin >> n;
  cp_ms(n);
  return 0;
}