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>).
# print("Hello World!")
s=0
st=input()
n=len(st)
t=0
le=n
for i in range(n):
   t+=(abs((int(st[i])-s))*le)
   s=int(st[i])
   le-=1
print(t)