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;
  cin >> n;
  int matrix[n][n];
  int ni = 1;
  int nim = 1;
  int npa = 2;
  bool nn = false;
  for (int i = 0; i < n; i++) {
    int pos = 0;
    for (int j = 0; j < (n - ni) / 2; j++) {
      matrix[i][pos] = npa;
      npa += 2;
      pos++;
    }
    for (int j = 0; j < ni; j++) {
      matrix[i][pos] = nim;
      nim += 2;
      pos++;
    }
    for (int j = 0; j < (n - ni) / 2; j++) {
      matrix[i][pos] = npa;
      npa += 2;
      pos++;
    }
    if (ni == n) nn = true;
    if (nn) {
      ni -= 2;
    } else
      ni += 2;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << matrix[i][j] << ' ';
    }
    cout << endl;
  }
  return 0;
}