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;
bool flag[55][55];
int n;
int main() {
  scanf("%d", &n);
  memset(flag, 0, sizeof(flag));
  int len = n * n / 2 + 1;
  int x = n / 2 + 1;
  for (int i = 1; i <= n; ++i) {
    flag[x][i] = 1;
    flag[i][x] = 1;
    len--;
    len--;
  }
  len++;
  int i = 1;
  while (len) {
    for (int j = 1; x + j <= n && len; ++j) {
      flag[x + i][x + j] = 1;
      flag[x + i][x - j] = 1;
      flag[x - i][x - j] = 1;
      flag[x - i][x + j] = 1;
      len -= 4;
    }
    i++;
  }
  int fir = 1;
  int sec = 2;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (flag[i][j]) {
        printf("%d", fir);
        fir += 2;
      } else {
        printf("%d", sec);
        sec += 2;
      }
      if (j == n) {
        printf("\n");
      } else {
        printf(" ");
      }
    }
  }
  return 0;
}