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>).

def solve(n, flag):
  arr = [int(x) for x in n]
  ans = 0
  for i in range(len(arr)-1, 0, -1):
    if arr[i] < arr[i-1]:
      for j in range(i+1, len(arr)):
        arr[j] += arr[i-1] - arr[i]
        ans += arr[i-1] - arr[i]
      ans += arr[i-1] - arr[i]
      arr[i] = arr[i-1]
  if flag == 1:
    return ans + sum(arr)
  else:
    return ans

n = input()

ans1 = solve(n, 1)
# print(ans)
cur = "1"
while int(cur) < int(n):
  cur += '1'

# print(cur)
n2 = int(cur) - int(n)
ans2 = len(cur) + solve(str(n2), 1)

# print(ans1, ans2)
print(min(ans1, ans2))
