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>).
n = int(input())
d = {n: 0}
m = len(str(n)) + 1
u = int('1' * m)
for i in range(m, 0, -1):
    d, e, u = {}, d, u // 10
    for v, c in e.items():
        lim = v // u
        for x in range(-1 - lim, 1 - lim):
            t = v + x * u
            d[t] = min(c + i * abs(x), d.get(t, 999))
print(d[0])