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>
#pragma GCC optimize("O3")
using namespace std;
int a[50][50];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  int i, j, k = 1, l = 1;
  int lt = 1;
  i = (n + 1) / 2;
  while (lt <= n) {
    j = 1;
    while (j <= lt) {
      a[l][i + j - 1] = k;
      k += 2;
      ++j;
    }
    lt += 2;
    --i;
    ++l;
  }
  i += 2;
  lt -= 4;
  while (lt >= 1) {
    j = 1;
    while (j <= lt) {
      a[l][i + j - 1] = k;
      k += 2;
      ++j;
    }
    lt -= 2;
    ++i;
    ++l;
  }
  k = 2;
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= n; ++j) {
      if (!a[i][j]) a[i][j] = k, k += 2;
      cout << a[i][j] << " ";
    }
    cout << "\n";
  }
  return 0;
}