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;
signed main() {
  long long n;
  cin >> n;
  long long arr[100][100];
  for (long long i = 0; i < n; i++) {
    long long len = n / 2 - i;
    for (long long j = 0; j < len; j++) {
      long long x1 = i, x2 = n - i - 1;
      long long y1 = j, y2 = n - j - 1;
      arr[x1][y1] = 1;
      arr[x1][y2] = 1;
      arr[x2][y1] = 1;
      arr[x2][y2] = 1;
    }
  }
  long long even = 2, odd = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (arr[i][j]) {
        arr[i][j] = even;
        even += 2;
      } else {
        arr[i][j] = odd;
        odd += 2;
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cout << arr[i][j] << " ";
    }
    cout << endl;
  }
}