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 double PI = acos(-1.0);
const double eps = 1e-9;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 2e5 + 5;
int a[55][55];
int main() {
  int n;
  cin >> n;
  int st = (n + 1) / 2, en = st, num = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = st; j <= en; j++) {
      a[i][j] = num;
      num += 2;
    }
    st -= (i <= n / 2 ? 1 : -1);
    en += (i <= n / 2 ? 1 : -1);
  }
  int cnt = 2;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (!a[i][j]) a[i][j] = cnt, cnt += 2;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
    puts("");
  }
}