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;
const int maxn = 300005;
int t, n, m, ans;
int a[50][50];
char str[maxn];
int main() {
  scanf("%d", &n);
  int x = 0;
  int y = n / 2;
  for (int i = 1; i <= n * n; i++) {
    a[x][y] = i;
    if (a[(x - 1 + n) % n][(y + 1) % n])
      x++;
    else {
      x = (x - 1 + n) % n;
      y = (y + 1) % n;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) cout << a[i][j] << ' ';
    cout << endl;
  }
}