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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int odd = 1;
  long long int even = 2;
  long long int countEvens = n / 2;
  long long int countOdds = 1;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < countEvens; j++) {
      cout << even << " ";
      even += 2;
    }
    for (long long int j = 0; j < countOdds; j++) {
      cout << odd << " ";
      odd += 2;
    }
    for (long long int j = 0; j < countEvens; j++) {
      cout << even << " ";
      even += 2;
    }
    cout << endl;
    if (i < n / 2) {
      countEvens--;
      countOdds += 2;
    } else {
      countEvens++;
      countOdds -= 2;
    }
  }
  return 0;
}