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>).
from sys import stdin as cin,stdout as cout
from math import factorial as f
from itertools import combinations as comb
n = int(cin.readline())
a=[]
s='1'
for i in range(16):
  a.append(int(s))
  s+='1'

sum = 0

while n!=0:
  k = len(str(n))
  m = int(n/a[k-1])
  if m==0:
    m = 1
    n = a[k-1]-n
  else:
    n=n%a[k-1]

  sum+=(m*k)


print(sum)