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>).
s=input()
n=len(s)
s=list(map(int,s))
X=[0]*n
ans=0
for i in range(n):
    delta=s[i]-X[i]
    if(delta==0):
        continue
    z=2*((n-i)+1)
    z+=(9-abs(delta))*(n-i)
    zz=abs(delta)*(n-i)
    
    if(z<zz):
        ans+=z
        for j in range(i+1,n):
            X[j]+=delta
    else:
        ans+=zz
        for j in range(i+1,n):
            X[j]-=(9-delta)
            if(delta>0):
                X[j]-=1
            else:
                X[j]+=1
    
print(ans)
    
