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.

Input

The first line of the input contains integer n (1 ≤ n < 1015).

Output

Print expected minimal number of digits 1.

Examples

Input

121


Output

6
  import java.util.*;
    public class OneBasedArithmetic {
        static long edinici[]=new long[17];   // 10^15
     
     
        static long oba(long n,int i){
            int k=(int) (n/edinici[i]);      // number of times current 111... occurs
            n %= edinici[i];                 // remainder of the division from the current state of the number and the current 111...
            long count=k*i;                  // the whole number that can be divided with the number * i (number
                                             // of 1's in the edinici[i]) to get the specific amount of 1's
            if(n==0) return count;           // stopping condition if the number is zero
            else
                return count+Math.min(i+oba(edinici[i]-n,i-1),oba(n,i-1));
        }
     
     
        public static void main(String[] args) {
            Scanner scan=new Scanner(System.in);
            long n=scan.nextLong();                 // number to be calculated
            edinici[0] = 0;
            for(int i = 1; i <= 16; i++){
            	edinici[i]=edinici[i-1] * 10 + 1;   // initialise the array
            }
            long rezultat = oba(n,16);
            System.out.println(rezultat);
        }
    }