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* &lt; 10<sup class="upper-index">15</sup>).
number = input()[::-1]
n = len(number)
factor = [0]*n

ac = 0
res = 0

for i in range(n-1, -1, -1):
    d = int(number[i])
    res += abs(ac-d)*(i+1)
    ac = d

print(res)