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>).
num=int(input())
kolvoed=0
while num:
    sk='1'
    while int(sk)<num:
        sk=sk+'1'
    if(len(sk)!=1):
        if (int(sk)-num)>(num-int(sk[:-1])):
            num=num-int(sk[:-1])
            kolvoed+=len(sk)-1
        else:
            num=int(sk)-num
            kolvoed+=len(sk)
    else:
        num-=1
        kolvoed+=1
print(kolvoed)
    
    
