No tag edit access

C. One-Based Arithmetic

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* < 10^{15}).

Output

Print expected minimal number of digits 1.

Examples

Input

121

Output

6

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/18/2017 09:57:11 (c3).

Desktop version, switch to mobile version.

User lists

Name |
---|