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 cap[50][50];
int main() {
  int n;
  scanf("%d", &n);
  int cnt = 0;
  int x = 0;
  int y = n / 2;
  cap[x][y] = ++cnt;
  while (cnt < n * n) {
    x = x - 1;
    y = y + 1;
    if (x == -1 && y == n) {
      x = 1;
      y = n - 1;
    } else if (x < 0) {
      x = n - 1;
    } else if (y >= n) {
      y = 0;
    }
    if (cap[x][y] != 0) {
      x = x + 2;
      y = y - 1;
    }
    while (cap[x][y] != 0) x++;
    cap[x][y] = ++cnt;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n - 1; j++) printf("%d ", cap[i][j]);
    printf("%d\n", cap[i][n - 1]);
  }
}