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>).
def sz(n):
    if n >= 0:
        return len(str(n))
    else:
        return len(str(n)) - 1

a = []
n = int(input())

def f(n):
    if n == 0:
        return
    s = ''
    for i in range(sz(n)):
        s += '1'
    if n < 0:
        a.append(0 - int(s))
        f(n + int(s))
    else:
        a.append(int(s))
        f(n - int(s))

f(n)
ans = 0
for i in a:
    ans += sz(i)
print(ans)
