Problem Statement

Construct 1 magic square with $N$ rows and $N$ columns.
In general, there are multiple magic squares with $N$ rows and $N$ columns, but any of them is acceptable.

In this problem, a magic square with $N$ rows and $N$ columns is
an arrangement of the integers from $1$ to $N^2$ in $N$ rows and $N$ columns
such that the sums of the numbers in each row, in each column, and on each of the 2 diagonals are all equal.

An example of a magic square with $3$ rows and $3$ columns:

2 9 4
7 5 3
6 1 8

Input

$N$

$3 \le N \le 20$
$N$ is an integer.

Output

$A_{1,1}$ $A_{1,2}$ $\dots$ $A_{1,N}$
$A_{2,1}$ $A_{2,2}$ $\dots$ $A_{2,N}$
$\vdots$
$A_{N,1}$ $A_{N,2}$ $\dots$ $A_{N,N}$

Output 1 magic square with $N$ rows and $N$ columns.
On the $y$-th line of the output, print the numbers in the $y$-th row of the magic square, separated by spaces, in order starting from the number in column $1$, $A_{y,1}$.
(Extra spaces before or after the numbers are allowed.)

Sample

3

2 9 4
7 5 3
6 1 8