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 int MAX_SIZE = 50;
int grid[MAX_SIZE][MAX_SIZE];
int odd[MAX_SIZE * MAX_SIZE];
int even[MAX_SIZE * MAX_SIZE];
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 1, j = 0; i <= n * n; i += 2, ++j) {
    odd[j] = i;
  }
  for (int i = 2, j = 0; i <= n * n; i += 2, ++j) {
    even[j] = i;
  }
  for (int i = 0; i < MAX_SIZE; i++) {
    for (int j = 0; j < MAX_SIZE; j++) grid[i][j] = 0;
  }
  int counter = 0;
  for (int i = 1, j = 0; i <= n && j <= n / 2; i += 2, ++j) {
    for (int k = n / 2 - i / 2; k <= n / 2 + i / 2; k++) {
      grid[j][k] = odd[counter];
      counter++;
    }
  }
  for (int i = n - 2, j = n / 2 + 1; i >= 1 && j < n; i -= 2, ++j) {
    for (int k = n / 2 - i / 2; k <= n / 2 + i / 2; k++) {
      grid[j][k] = odd[counter];
      counter++;
    }
  }
  counter = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (grid[i][j] == 0) {
        grid[i][j] = even[counter];
        counter++;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << grid[i][j] << " ";
    }
    cout << endl;
  }
  return 0;
}