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() {
  long long t;
  while (cin >> t) {
    if (t == 1) {
      cout << 1 << endl;
      continue;
    }
    int a = 1, b = 2, ins = 0, num = 1;
    bool f = false;
    for (int i = 0; i < t; i++) {
      if (i != 0) {
        if (num != t && !f)
          num += 2;
        else
          num -= 2;
        if (num == t) f = true;
      }
      for (int j = 0; j < t; j++) {
        if (j >= (t - num) / 2 && j < (t + num) / 2) {
          cout << a << " ";
          a += 2;
        } else {
          cout << b << " ";
          b += 2;
        }
      }
      cout << endl;
    }
  }
}