Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

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-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/19/2019 22:46:50 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|