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 math as math

def oneBase(n):
    ones = 0
    n = abs(n)
    while n > 0:
        upper = len(str(n)) + 1
        below = upper - 1
        upperOnes = int('1' * upper)
        belowOnes = int('1' * below) 
        
        if n < belowOnes:
            
            upper -= 1
            below -= 1
        upperOnes = int('1' * upper)
        belowOnes = int('1' * below) 
        
        upperDif = upperOnes - n
        belowDif = n - belowOnes
        if upperDif < belowDif:
            ones += (upper)
            n =  upperOnes - n
            # print(n,upper,ones,n//upperOnes,upperOnes,n,temp)
            
        else:
            temp = (n//belowOnes)
            ones +=( temp * below)
            n = n - ( temp * belowOnes) 
    print(ones)
def main():
    oneBase(int(input()))
main()

