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 main() {
  int N, a = 1, b = 2;
  scanf("%d", &N);
  for (int i = 0; i < N * N; i++) {
    if ((((N / 2 - i / N) > 0 ? (N / 2 - i / N) : (-(N / 2 - i / N))) +
         ((N / 2 - i % N) > 0 ? (N / 2 - i % N) : (-(N / 2 - i % N)))) <=
        N / 2) {
      printf("%d ", a);
      a += 2;
    } else {
      printf("%d ", b);
      b += 2;
    }
  }
  return 0;
}