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>).
from array import array

n, ans = int(input()), 0
ones = array('u', ['1'] * 15)

while n > 10:
    while n < int(''.join(ones)):
        ones.pop()

    n -= int(''.join(ones))
    ans += len(ones)

if n:
    ans += min(n, 11 - n + 2)
print(ans)
