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;
public class CF710C {
    public static void main(String args[]){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(),odd[] = new int[(n*n)/2+1], even[] = new int[(n*n)/2+1],e=0,o=0,m=0;
        int y = n;
        n*=n;
        for(int i=1;i<=n;i++){
            if(i%2 == 0){
                even[e] = i;
                ++e;
            }
            else{
                odd[o] = i;
                ++o;
            }
        }
        e=0;o=0;
        for(int i=0;i<y;i++){
            for(int j=0;j<y;j++){
                if(j>=y/2-m && j<=(y/2)+m && o<=n/2){
                    System.out.print(odd[o]+" ");
                    ++o;
                }
                else{
                    System.out.print(even[e]+" ");
                    ++e;
                }
            }
            if(i>=y/2){
                --m;
            }
            else{
                ++m;
            }
            System.out.println();
        }
    }
}