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 n, x, y;
int mp[200][200];
int main() {
  scanf("%d", &n);
  x = 1, y = (n + 1) / 2;
  mp[x][y] = 1;
  for (int i = 2; i <= n * n; i++) {
    if (x == 1 && y != n)
      x = n, y++;
    else if (x != 1 && y == n)
      x--, y = 1;
    else if (x == 1 && y == n)
      x++;
    else if (!mp[x - 1][y + 1])
      x--, y++;
    else
      x++;
    mp[x][y] = i;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", mp[i][j]);
    printf("\n");
  }
}