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 f(int n, int x, int y) { return (x + y * 2 + 1) % n; }
int main() {
  int i, j, n;
  cin >> n;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++)
      cout << f(n, n - j - 1, i) * n + f(n, j, i) + 1 << ' ';
    cout << endl;
  }
  return 0;
}