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;
using LL = unsigned long long;
const int maxn = 1000111;
const int INF = 1 << 30;
const LL LNF = 1LL << 60;
int n, m[50][50], p, q;
int main() {
  scanf("%d", &n);
  p = (n * n + 1) / 2;
  q = n * n - p;
  for (int i = 0; i < n / 2; i++) {
    for (int j = 0; j < n / 2; j++) {
      if (q > 0) {
        q -= 4;
        m[i][j] = 1;
        m[n - 1 - i][j] = 1;
        m[i][n - 1 - j] = 1;
        m[n - 1 - i][n - 1 - j] = 1;
      }
    }
  }
  int a = 1, b = 2;
  for (int i = 0; i <= n - 1; i++) {
    for (int j = 0; j <= n - 1; j++)
      if (m[i][j]) {
        printf("%d ", b);
        b += 2;
      } else {
        printf("%d ", a);
        a += 2;
      }
    printf("\n");
  }
  return 0;
}