Fast Travel Coloring

You are given a complete undirected graph with $7n$ vertices (here $n$ is a positive integer). Your task is to paint its edges in $n$ colors in such a way that for each pair of vertices and each color there is a path of at most two edges of this color connecting this pair of vertices. More formally, for each pair of vertices $u, v$ and each color $c$ at least one of the two options should hold:

• the edge between $u$ and $v$ has color $c$;
• there is a vertex $w$ that both edges $(u, w)$ and $(w, v)$ have color $c$.

The only line of input contains a positive integer $n$ ($7\leqslant 7n\leqslant 1000$).

Let us number the colors from $1$ to $n$. Let $c\_{i, j}$ be $0$ if $i = j$, and the color of the edge $(i, j)$ in your coloring otherwise (in particular, in this case $c\_{i, j} = c\_{j, i}$). Print $c\_{i, j}$ in $7n$ lines containing $7n$ numbers each.

It is guaranteed that a solution exists.

The second sample test corresponds to the following coloring:

Here are two separate subgraphs for both colors: