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):
    if n <= 3:
        return n
    rem = n % 11
    if rem == 0:
        return 3 * (n // 11)
    if rem == 1:
        return 3 * (n // 11) + 1 + count_digits(n % 10)
    return 3 * (n // 11) + count_digits(n % 11)

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