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.Scanner;
import java.lang.Math;

public class oneBased {
    static long niz[] = new long[17];

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        long num = scan.nextLong();
        scan.close();

        niz[0] = 0;
        for (int i = 1; i <= 16; i++) {
            niz[i] = niz[i - 1] * 10 + 1;
        }
        System.out.println(ones(num, 16));
    }

    static long ones(long num, int i) {
        long br = i * (num / niz[i]);
        num %= niz[i];
        if (num == 0)
            return br;
        return br + Math.min(i + ones(niz[i] - num, i - 1), ones(num, i - 1));
    }

}
