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
d={input():0}
for i in range(20,0,-1):
 d,e={},d
 u=10**i/9
 for v,c in e.items():
  for x in range(-6,7):
	t=x*u+v
	if abs(t)<u:d[t]=min(c+i*abs(x),d.get(t,999))
print d[0]
