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];
int p = 1, k = 2;
int lp = 0, lk = 0;
int main() {
  scanf("%d", &n);
  int a = n / 2, b = n - 1;
  for (int num = 1; num <= n * n;) {
    if (a == -1 && b == n) {
      b = n - 2;
      a = 0;
    } else {
      if (b == n) b = 0;
      if (a < 0) a = n - 1;
    }
    if (m[a][b] != 0) {
      b -= 2;
      a++;
      continue;
    } else
      m[a][b] = num++;
    b++;
    a--;
  }
  for (int i = 0; i <= n - 1; i++) {
    for (int j = 0; j <= n - 1; j++) printf("%d ", m[i][j]);
    printf("\n");
  }
  return 0;
}