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.

Input

The first line of the input contains integer n (1 ≤ n < 1015).

Output

Print expected minimal number of digits 1.

Examples

Input

121


Output

6
n = int(input())
d = {n: 0}
u = 10 ** (len(str(n)) + 2) // 9
for i in range(len(str(n)) + 1, 0, -1):
    d, e = {}, 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])