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 num[50][50];
int n;
void output() {
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) printf("%d%c", num[i][j], j == n ? '\n' : ' ');
}
void solve() {
  int i = 0, j = (n + 1) / 2, k;
  for (k = 1; k <= n * n; ++k) {
    if (k % n == 1)
      i++;
    else {
      i--;
      j++;
    }
    if (i == 0) i = n;
    if (j > n) j = 1;
    num[i][j] = k;
  }
}
int main() {
  while (scanf("%d", &n) != EOF) {
    if (n == 1) {
      printf("1\n");
      continue;
    }
    solve();
    output();
  }
  return 0;
}