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 m, n, k, l, s;
bool A[50][50];
int main() {
  int i, j;
  scanf("%d", &n);
  k = n * n / 2 + 2, m = n / 2 + 1, l = s = 1;
  A[m][m] = 1;
  for (i = 1; i <= n; i++) A[m][i] = 1, A[i][m] = 1, k -= 2;
  i = j = 1;
  while (k) {
    A[i][j] = 1, A[n - i + 1][j] = 1, A[i][n - j + 1] = 1,
    A[n - i + 1][n - j + 1] = 1;
    if (i + 1 == m)
      i = 1, j++;
    else
      i++;
    k -= 4;
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (A[i][j])
        printf("%d ", s * 2 - 1), s++;
      else
        printf("%d ", l * 2), l++;
    }
    printf("\n");
  }
}