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;
  int pos = 0, neg = 0, disx, disy;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      disx = abs((n + 1) / 2 - i), disy = abs((n + 1) / 2 - j);
      int mmin = min(disx, disy);
      if (mmin % 2 == 0)
        printf("%d", 2 * (pos + 1) - 1), pos++;
      else
        printf("%d", 2 * (neg + 1)), neg++;
      if (j < n)
        printf(" ");
      else
        printf("\n");
    }
  return 0;
}