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 mp[55][55];
int main() {
  int n;
  scanf("%d", &n);
  int now = 1;
  for (int i = 1; i <= n / 2 + 1; ++i) {
    for (int j = n / 2 + 1 - i + 1; j <= n / 2 + 1 + i - 1; ++j)
      mp[i][j] = now, now += 2;
  }
  for (int i = n / 2 + 1 + 1; i <= n; ++i) {
    for (int j = i - n / 2 - 1 + 1; j <= n - (i - n / 2 - 1); ++j)
      mp[i][j] = now, now += 2;
  }
  now = 2;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (mp[i][j] == 0) mp[i][j] = now, now += 2;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (j > 1) putchar(' ');
      printf("%d", mp[i][j]);
    }
    puts("");
  }
  return 0;
}