Problem Statement

In the Kingdom of AtCoder, only banknotes are used as currency. There are $10^{100}+1$ kinds of banknotes, with the values of $1, 10, 10^2, 10^3, \dots, 10^{(10^{100})}$. You have come shopping at a mall and are now buying a takoyaki machine with a value of $N$. (Takoyaki is the name of a Japanese snack.)

To make the payment, you will choose some amount of money which is at least $N$ and give it to the clerk. Then, the clerk gives you back the change, which is the amount of money you give minus $N$.

What will be the minimum possible number of total banknotes used by you and the clerk, when both choose the combination of banknotes to minimize this count?

Assume that you have sufficient numbers of banknotes, and so does the clerk.

Constraints

• $N$ is an integer between $1$ and $10^{1,000,000}$ (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print the minimum possible number of total banknotes used by you and the clerk.