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;

public class EvenHarder {

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

	private static long find(long n, long[] a, int i) {
		long div=n/a[i];
		long cnt=div*i;
		n%=a[i];
		if(n==0)return cnt;
		return cnt+Math.min(i+ find (a[i]-n,a, i-1), find(n, a, i-1));
	}
}