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
acc = []
n = int(input())
def OneNum (num, One):
 onetrans = num // acc[One]
 num = num % acc[One] 
 if num == 0:
  return onetrans*One
 else:
  return onetrans*One + min(OneNum(num, One-1), One + OneNum(acc[One] - num, One - 1))
acc.append(0)
for i in range(1,17):
 acc.append (acc[i-1]*10 + 1)
print (OneNum(n,16))