#P440C. One-Based Arithmetic
-
ID: 7823
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: 6
Uploaded By:
Hydro
Tags> One-Based Arithmetic
Description
Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+–1. Help him to find the least number of digits 1 in such sum.
The first line of the input contains integer n (1 ≤ n < 1015).
Print expected minimal number of digits 1.
Input
The first line of the input contains integer n (1 ≤ n < 1015).
Output
Print expected minimal number of digits 1.
121
6