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 Main {
    static long enke[]=new long[17];


    static long vsota(long n,int i){
        int k=(int) (n/enke[i]);
        n %= enke[i];
        long sestevek=k*i;
        if(n==0) return sestevek;
        else
            return sestevek+Math.min(i+vsota(enke[i]-n,i-1),vsota(n,i-1));
    }


    public static void main(String[] args) {
        Scanner scan=new Scanner(System.in);
        long n=scan.nextLong();
        enke[0] = 0;
        for(int i = 1; i <= 16; i++){
            enke[i]=enke[i-1] * 10 + 1;
        }
        long rezultat = vsota(n,16);
        System.out.println(rezultat);
    }
}
