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

def find(n,i)
	k = n // ones[i]
	n = n % ones[i]
	ans = ans + k * i
	
	if n == 0:
		return ans
	return ans + min(find(n, i-1), i + find(ones[i] - n, i-1)
	
n = int(input())

ones = [0]
for i in range(1,17)
	one = 10 * ones[i-1] + 1
	ones.append(one)
	

print(find(n,16))


