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 f(int n) {
  int a[n][n], i, j;
  memset(a, 0, sizeof a);
  i = n / 2;
  j = n - 1;
  for (int num = 1; num <= n * n;) {
    if (i == -1 && j == n) {
      j = n - 2;
      i = 0;
    } else {
      if (j == n) j = 0;
      if (i < 0) i = n - 1;
    }
    if (a[i][j]) {
      j -= 2;
      i++;
      continue;
    } else {
      a[i][j] = num++;
    }
    j++;
    i--;
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) cout << a[i][j] << " ";
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  f(n);
  return 0;
}