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>).
import sys, math
input = sys.stdin.readline
 
def getInt(): return int(input())
def getVars(): return map(int, input().split())
def getList(): return list(map(int, input().split()))
def getStr(): return input().strip()
## -------------------------------

n = getStr()
last = 0
res = 0
for i in range(len(n)):
    res += abs(int(n[i]) - last)*(len(n)-i)
    last = int(n[i])
print(res)

'''
1919 =
1111 * 1
111*8
-11*8
1*8


'''
