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>).
multiplos_de_onze = [0, 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 
                     111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 
                     11111111111111111]


def procura_onze(n, i):  # i = 16 pois será as posições do vetor decrementadas
    divisao = int(n / multiplos_de_onze[i])
    resto = n % multiplos_de_onze[i]
    if resto == 0:
        return divisao*i
    else:
        return divisao*i + min(i + procura_onze(multiplos_de_onze[i] - resto, i - 1), procura_onze(resto, i - 1))


def divide():
    n = int(input())
    m = procura_onze(n, 16)
    print(m)


divide()