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 SolutionMaybe {

	public static long arr[] = new long[17];	
	
	public static long oneCount(long n, int i) {
		
		long dev = (int) (n/arr[i]);
		long count = dev * i;	 
		n %= arr[i];				
		if(n==0)
			return count;				
		else 
			return count + Math.min(i + oneCount(arr[i] - n, i - 1), oneCount(n, i - 1)); // 
	}
		
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();	
		arr[0]=0;
		for(int i = 1; i <= 16; i++) {		
			arr[i] = arr[i-1]*10+1; 
		}
		System.out.println(oneCount(n, 16));

	}

}
