3180: One-Based Arithmetic
金币值：2
定数：1
时间限制：2.000 s
内存限制：256 M
正确：0
提交：0
正确率：0.00% 命题人：
题目描述
time limit per test
0.5 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputProf. 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