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;
long long answer[55][55];
int n;
long long x;
long long c;
long long odd_counter = 1;
long long even_counter = 2;
long long counter;
bool q;
int main() {
  cin >> n;
  x = -1;
  for (int i = 0; i < n; i++) {
    if (x == n) {
      q = 1;
    }
    if (q == 1) {
      x -= 2;
    } else {
      x += 2;
    }
    c = (n - x) / 2;
    counter = 0;
    for (int j = 0; j < n; j++) {
      if (j >= c && counter < x) {
        answer[i][j] = odd_counter;
        odd_counter += 2;
        counter++;
      } else {
        answer[i][j] = even_counter;
        even_counter += 2;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << answer[i][j] << ' ';
    }
    cout << endl;
  }
  return 0;
}