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

	x_s = str(x)
	low = int("1"*len(x_s))
	high = int("1"*(len(x_s) + 1))
	if low >= x or abs(x - low) < abs(x - high):
		return len(x_s) + count(abs(x - low))
	else:
		return len(x_s) + 1 + count(abs(x - high))

print(count(n))