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>
const int inf = (1 << 30);
const long long INF = (1LL << 60);
using namespace std;
int a[55][55];
int main() {
  int n;
  scanf("%d", &n);
  if (n & 1) {
    int start = n / 2 + 2, add = -1, num = 1;
    for (int i = 1; i <= n; i++) {
      if (i <= n / 2 + 1)
        start--, add += 2;
      else
        start++, add -= 2;
      for (int j = start; j <= start + add - 1; j++, num += 2) a[i][j] = num;
    }
  }
  int num = 2;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (a[i][j]) continue;
      a[i][j] = num;
      num += 2;
    }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
    puts("");
  }
  return 0;
}