A9521. One-Based Arithmetic
编程题
普及/提高-
知识点
题目描述
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.
输入格式
The first line of the input contains integer $n$ ( $1<=n<10^{15}$ ).
输出格式
Print expected minimal number of digits 1.
输入输出样例
输入 #1
121
输出 #1
6