We want to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, we can represent 121 as 121=111+11+1. Help us to find the least number of digits 1 in such sum.

Input: The first line of the input contains integer n (1n<10¹⁵).

Output: Print expected minimal number of digits 1.

(ex. input:121, output:6)