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=int(input())
#n, p,q,r = map(int, input().split())
#arr = list(map(int, input().split()))
s=input()
n=len(s)
m=0
ans=0
for i in range(len(s)):
    if int(s[i])>=m:
        ans+=(int(s[i])-m)*(n-i)
    else:
        ans+=(m-int(s[i]))*(n-i)
        m=int(s[i])

    m=max(m,int(s[i]))
print(ans)
