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, r = int(input()), 0

while n:
    l = len(str(n))
    x = int('1'*(l+1))
    a, b = abs(x - n), abs(n - x//10)
    if a >= b:
        n, r = b, r + l
        print(x//10)
    else:
        n, r = a, r + l + 1
        print(x)

print(r)