Fast Travel Coloring

You are given a complete undirected graph with $7n$ vertices, where $n$ is a positive integer. Paint its edges in $n$ colors so that for each pair of vertices $u, v$ and each color $c$, at least one of the following holds:

• The edge between $u$ and $v$ has color $c$.
• There is a vertex $w$ such that both edges $(u, w)$ and $(w, v)$ have color $c$.

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

Number the colors from 1 to $n$. Let $c_{i,j}$ be $0$ if $i = j$, and the color of the edge $(i, j)$ otherwise (so $c_{i,j} = c_{j,i}$). Print $c_{i,j}$ in $7n$ lines of $7n$ numbers each.

A solution is guaranteed to exist.

The second sample corresponds to the following coloring. The two images below show the subgraph for each color.