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;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  return x * f;
}
int A[50][50];
int main() {
  int n = read();
  int odd = 1, even = 2, x = (n + 1) >> 1;
  for (int i = 1; i <= n; i++)
    for (int j = abs(x - i) + 1; j <= (n + 1) - abs(x - i) - 1; j++)
      A[i][j] = odd, odd += 2;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (!A[i][j])
        printf("%d%c", even, j == n ? '\n' : ' '), even += 2;
      else
        printf("%d%c", A[i][j], j == n ? '\n' : ' ');
  return 0;
}