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, a[300008];
int main() {
  int n;
  scanf("%d", &n);
  int m = n / 2;
  int x = n / 2;
  int y = 0;
  int q = 1, r = 2;
  for (int i = 1; i <= m + 1; i++) {
    for (int j = 1; j <= y; j++) {
      printf("%d ", q);
      q += 2;
    }
    for (int b = x; b > 0; b--) {
      printf("%d ", r);
      r += 2;
    }
    printf("%d ", q);
    q += 2;
    for (int b = x; b > 0; b--) {
      printf("%d ", r);
      r += 2;
    }
    for (int j = 1; j <= y; j++) {
      printf("%d ", q);
      q += 2;
    }
    printf("\n");
    x--;
    y++;
  }
  x += 2;
  y -= 2;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= y; j++) {
      printf("%d ", q);
      q += 2;
    }
    for (int b = x; b > 0; b--) {
      printf("%d ", r);
      r += 2;
    }
    printf("%d ", q);
    q += 2;
    for (int b = x; b > 0; b--) {
      printf("%d ", r);
      r += 2;
    }
    for (int j = 1; j <= y; j++) {
      printf("%d ", q);
      q += 2;
    }
    printf("\n");
    x++;
    y--;
  }
  return 0;
}