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 g[50][50];
int i, j, n, t1, t2;
int dis(int x, int y) {
  int t1 = (x - 1) + (y - 1);
  int t2 = (x - 1) + (n - y);
  int t3 = (n - x) + (y - 1);
  int t4 = (n - x) + (n - y);
  return min(min(t1, t2), min(t3, t4));
}
int main() {
  scanf("%d", &n);
  t1 = 1, t2 = 2;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++)
      if (dis(i, j) < n / 2)
        g[i][j] = t2, t2 = t2 + 2;
      else
        g[i][j] = t1, t1 = t1 + 2;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) printf("%d ", g[i][j]);
    printf("\n");
  }
  return 0;
}