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.

Input

The first line of the input contains integer n (1 ≤ n < 1015).

Output

Print expected minimal number of digits 1.

Examples

Input

121


Output

6
import math

def find(n,i):
	ans = 0
	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))

