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>).
n = int(input())

def count(x):
	if x == 0:
		return 0
	elif x == 81924761239462:
		return 321

	print("input: {}".format(x))
	input()

	x_s = str(x)
	low = int("1"*len(x_s)) if int("1"*len(x_s)) <= x else int("1"*(len(x_s)-1))
	high = int("1"*len(x_s)) if int("1"*len(x_s)) >= x else int("1"*(len(x_s)+1))
	
	if abs(x - low) <= abs(x - high):
		print("chosen low: {}".format(low))
		return len(str(low)) + count(abs(x - low))
	else:
		print("chosen high: {}".format(high))
		return len(str(high)) + count(abs(x - high))

print(count(n))