You are given an integer array $a_1, a_2, \dots, a_n$, where $a_i$ represents the number of blocks at the $i$-th position. It is guaranteed that $1 \le a_i \le n$.

In one operation you can choose a subset of indices of the given array and remove one block in each of these indices. You can't remove a block from a position without blocks.

All subsets that you choose should be different (unique).

You need to remove all blocks in the array using at most $n+1$ operations. It can be proved that the answer always exists.

Input

The first line contains a single integer $n$ ($1 \le n \le 10^3$) — length of the given array.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$) — numbers of blocks at positions $1, 2, \dots, n$.

Output

In the first line print an integer $op$ ($0 \le op \le n+1$).

In each of the following $op$ lines, print a binary string $s$ of length $n$. If $s_i=$'0', it means that the position $i$ is not in the chosen subset. Otherwise, $s_i$ should be equal to '1' and the position $i$ is in the chosen subset.

All binary strings should be distinct (unique) and $a_i$ should be equal to the sum of $s_i$ among all chosen binary strings.

If there are multiple possible answers, you can print any.

It can be proved that an answer always exists.

Note

In the first example, the number of blocks decrease like that:

$\lbrace 5,5,5,5,5 \rbrace \to \lbrace 4,4,4,4,4 \rbrace \to \lbrace 4,3,3,3,3 \rbrace \to \lbrace 3,3,2,2,2 \rbrace \to \lbrace 2,2,2,1,1 \rbrace \to \lbrace 1,1,1,1,0 \rbrace \to \lbrace 0,0,0,0,0 \rbrace$. And we can note that each operation differs from others.