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;
const int maxn = 300010;
int A[50][50];
int main() {
  int n;
  scanf("%d", &n);
  int x = 1, y = 2;
  int start = n / 2 + 1, ed = n / 2 + 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (j >= start && j <= ed) {
        A[i][j] = x;
        x += 2;
      } else {
        A[i][j] = y;
        y += 2;
      }
    }
    if (i <= n / 2) {
      start--;
      ed++;
    } else {
      start++;
      ed--;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      printf("%d ", A[i][j]);
    }
    printf("\n");
  }
}