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)
ans=0
X=[0]*n
for i in range(n):
    h=int(s[i])
    delta=h-X[i]
    if(delta==0):
        continue
    if(delta>0):
        ans+=delta*(n-i)
        for j in range(i+1,n):
            X[j]+=delta
    else:
        ans-=delta*(n-i)
        for j in range(i+1,n):
            X[j]-=delta
print(ans)
