beecrowd | 1786
# SSN 2

**Timelimit: 1**

By Alexandre Campos, UNIUBE Brazil

You are about to write a program to predict a CPF, which, in Brazil, is equivalent to Social Security Number. It is composed by 11 digits and the lasts two (verification digits) are function of the nine previous. In this way, if a person informs a CPF, by mistake or on purpose, it is possible to find out. Let us introduce some notation. Let a CPF be

a_{1 }a_{2 }a_{3 }. a_{4 }a_{5 }a_{6 }. a_{7 }a_{8 }a_{9 }- b_{1 }b_{2}

To get b_{1}, one can multiply a_{1} by 1, a_{2} by 2, a_{3} by 3, so on, up to a_{9} by 9 and sum these results. Then, b_{1} is the remaining of this number when divided by 11, or 0 in case the remaining is 10.

Analogously, to get b_{2}, one can multiply a_{1} by 9, a_{2} by 8, a_{3} by 7, so on, up to a_{9} by 1 and sum these results. Then, b_{2} is the remaining of this number when divided by 11, or 0 in case the remaining is 10.

The input is composed by an unknown number of sequences in the form:

a_{1}a_{2}a_{3}a_{4}a_{5}a_{6}a_{7}a_{8}a_{9}

Each sequence represents the 9 firsts digits of a CPF.

For each sequence, you have to print the input sequence and the verification digits formated as

a_{1}a_{2}a_{3}.a_{4}a_{5}a_{6}.a_{7}a_{8}a_{9}-b_{1}b_{2}

Input Sample | Output Sample |

000000000 |
000.000.000-00 |