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):
    dp = [0] * (n + 1)
    for i in range(1, n+1):
        dp[i] = dp[i-1] + 1
        j = 1
        while(j <= i):
            if (i >= j and dp[i-j] + 1 < dp[i]):
                dp[i] = dp[i-j] + 1
            j = j * 10 + 1
    return dp[n]

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