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;
int n, m;
int a[50][50];
int b = 1, c = 2;
int check(int x, int y) {
  if (abs(x - m) + abs(y - m) <= m - 1) return 1;
  return 0;
}
int main() {
  scanf("%d", &n);
  m = (n + 1) / 2;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (check(i, j))
        printf("%d ", b), b += 2;
      else
        printf("%d ", c), c += 2;
    }
    printf("\n");
  }
  return 0;
}