# /yjdata/www/wordpress 「CF440C」One – Based Arithmetic - 记忆化搜索 - hzwer.com

「CF440C」One – Based Arithmetic

2014年6月4日5,0980

Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only1s. 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.

Sample test(s)
input

output

题解

 

avatar
  Subscribe  
提醒