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 count_digits(n):
    count = 0
    while n > 0:
        m = n
        k = 0
        while (m % 11 == 0):
            m = m // 11
            k += 1
        count += 3 * k
        n -= (11 ** k - 1)
    return count

n = int(input())
print(count_digits(n))
