Problem Statement

There is a grid with $N$ rows and $N$ columns (here, $N$ is even). yuki wants to write $0$, $1$, or $2$ in each cell. In doing so, the following condition must be satisfied.

• Let $A_i$ be the sum of the integers written in the $i$-th row from the top $(1 \leq i \leq N)$.
• Let $B_j$ be the sum of the integers written in the $j$-th column from the left $(1 \leq j \leq N)$.
• Then, the $2N$ integers $A_1, A_2, \cdots, A_N, B_1, B_2, \cdots, B_N$ are pairwise distinct.

Input

$N$

Output

If it is impossible to write $0, 1, 2$ in the cells so that the condition is satisfied, output No.

If it is possible, output $1$ way of writing them that satisfies the condition, in the following format.

$s_{1, 1}$$s_{1, 2}$$\cdots$$s_{1, N}$
$s_{2, 1}$$s_{2, 2}$$\cdots$$s_{2, N}$
 $\vdots$
$s_{N, 1}$$s_{N, 2}$$\cdots$$s_{N, N}$

Constraints

• $2 \leq N \leq 500$
• $N$ is even

Sample

2

01
22