Printing Digit Patterns

Problem Description

Little Yang designed a representation for the digits $0$, $1$, $2$ and $3$, each occupying a $5 \times 5$ grid. The representations are as follows:

..... ****. ..... .....
.***. ****. ****. ****.
.***. ****. ..... .....
.***. ****. .**** ****.
..... ****. ..... .....

Little Yang wants you to convert a given number $n$ into its corresponding representation.

Input Format

The first line contains a non-negative integer $n$.

Output Format

Output the corresponding representation.

Sample Input

12230

Sample Output

****.....................
****.****.****.****..***.
****.................***.
****..****.********..***.
****.....................

Sample Explanation

The input number is $12230$, corresponding in order to the digits $1$, $2$, $2$, $3$, $0$. Each digit's pattern is a $5 \times 5$ grid of characters. When concatenating, join the patterns row by row: for row 1, take digit 1's row 1 ****., digit 2's row 1 ....., then another digit 2's row 1 ....., digit 3's row 1 ....., and digit 0's row 1 .....; concatenate them in order and drop the separating spaces to get ****...................... Repeat the same process for rows 2 to 5 to obtain the final 5-line output shown above.

Constraints

For all data, $0 \le n \le 10^6$, and $n$ consists only of the digits $0$, $1$, $2$, $3$.