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 JAVA):

Solution:
import java.util.Scanner;
import java.util.Stack;

public class F {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Stack<Integer> odd = new Stack<>();
        Stack<Integer> even = new Stack<>();
        for (int i = 1; i <= n * n; i++) {
            if (i % 2 == 0) {
                even.push(i);
            } else {
                odd.push(i);
            }
        }
        for (int i = 0; i < (n + 1) / 2; i++) {
            for (int j = 0; j < (n - 1) / 2 - i; j++) {
                System.out.printf(even.pop() + " ");
            }
            for (int j = 0; j < 2 * i + 1; j++) {
                System.out.printf(odd.pop() + " ");
            }
            for (int j = 0; j < (n - 1) / 2 - i; j++) {
                System.out.printf(even.pop() + " ");
            }
            System.out.println();
        }
        for (int i = (n - 3) / 2; i >= 0; i--) {
            for (int j = 0; j < (n - 1) / 2 - i; j++) {
                System.out.printf(even.pop() + " ");
            }
            for (int j = 0; j < 2 * i + 1; j++) {
                System.out.printf(odd.pop() + " ");
            }
            for (int j = 0; j < (n - 1) / 2 - i; j++) {
                System.out.printf(even.pop() + " ");
            }
            System.out.println();
        }

    }
}