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.concurrent.SynchronousQueue;

public class C {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] a = new int[n][n];
        int odd = 1;
        int even = 2;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if(i == (n-1)/2 || j == (n-1)/2){
                    a[i][j] = odd;
                    odd+=2;
                }
                else{
                    int idelta = Math.abs(i-(n-1)/2);
                    int jdelta = Math.abs(j-(n-1)/2);
                    int minDelta = Math.min(idelta,jdelta);
                    if(minDelta%2==0){
                        a[i][j] = odd;
                        odd+=2;
                    }
                    else{
                        a[i][j] = even;
                        even+=2;
                    }
                }
                System.out.print(a[i][j]+" ");
            }
            System.out.println();
        }
    }
}