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 test {
	static long seznam[]=new long[17]; 
	static long isci(long n,int i){
		int j = (int) (n/seznam[i]);
		n %= seznam[i];
		long cnt = j*i;
		if(n==0) return cnt;
		else
			return cnt+Math.min(i+isci(seznam[i]-n,i-1),isci(n,i-1));
	}
	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		long n=scan.nextLong();
		scan.close();
		seznam[0]=0;
		
		for(int i=1;i<=16;i++){
		
			seznam[i] = seznam[i-1]*10+1;
		}
		System.out.println(isci(n,16));
	}
 
}
