Graph Tournament

Input

The first line contains a single integer $n$ (3 \le n \le 1000) — the number of vertices in the graph.

Output

Output $-1$ if no graph meets the specified conditions.

Otherwise, output $n$ lines, each containing $n$ numbers separated by spaces, representing the adjacency matrix $a$ of the tournament. Assume the vertices are numbered from $1$ to $n$. Here, a_{v,u} = 0 indicates no edge from vertex $v$ to vertex $u$, and a_{v,u} = 1 indicates the presence of an edge.

Since the graph must be a tournament, the following conditions must be satisfied:

• a_{v,u} + a_{u,v} = 1 for all $v$, $u$ (1 \le v, u \le n, v \ne u);

• a_{v,v} = 0 for all $v$ (1 \le v \le n).

Examples