Given an undirected complete graph with $n$ nodes, you need to assign a number from $0$ to $9$ to each edge such that there is no triangle or pentagon in the graph where all edges have the same number.

Input

The input consists of a single integer $n$, representing the number of nodes in the graph.

Output

If no such assignment exists, output a single integer $-1$. Otherwise, output $(n - 1)$ lines. The $i$-th line should contain $(n - i)$ characters, where the $j$-th character of the $i$-th line represents the label of the edge $(i, i + j)$. If there are multiple valid solutions, you may output any one of them.

Examples

Input 1

4

Output 1

012
34
5

Constraints

For all test cases, $2 \le n \le 1000$.