C. One-Based Arithmetictime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard 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.InputThe first line of the input contains integer n (1 ≤ n < 1015).OutputPrint expected minimal number of digits 1.ExamplesInput121Output6
Input121
Output6
['brute force', 'dfs and similar', 'divide and conquer', '*1800']