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 n;
int result[50][50];
int main() {
  cin >> n;
  result[0][n / 2] = 1;
  int lastx = 0, lasty = n / 2;
  for (int i = 1; i < n * n; ++i) {
    int nextx = lastx - 1, nexty = lasty + 1;
    if (nextx < 0) nextx = n - 1;
    if (nexty >= n) nexty = 0;
    if (result[nextx][nexty] != 0) {
      nextx = lastx + 1, nexty = lasty;
    }
    result[nextx][nexty] = i + 1;
    lastx = nextx, lasty = nexty;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (j != 0) cout << " ";
      cout << result[i][j];
    }
    cout << "\n";
  }
  return 0;
}