Let's denote a function f(x) in such a way: we add 1 to x, then, while there is at least one trailing zero in the resulting number, we remove that zero. For example, 

  * f(599) = 6: 599 + 1 = 600 → 60 → 6; 
  * f(7) = 8: 7 + 1 = 8; 
  * f(9) = 1: 9 + 1 = 10 → 1; 
  * f(10099) = 101: 10099 + 1 = 10100 → 1010 → 101. 



We say that some number y is reachable from x if we can apply function f to x some (possibly zero) times so that we get y as a result. For example, 102 is reachable from 10098 because f(f(f(10098))) = f(f(10099)) = f(101) = 102; and any number is reachable from itself.

You are given a number n; your task is to count how many different numbers are reachable from n.

Input

The first line contains one integer n (1 ≤ n ≤ 10^9).

Output

Print one integer: the number of different numbers that are reachable from n.

Examples

Input


1098


Output


20


Input


10


Output


19

Note

The numbers that are reachable from 1098 are:

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1098, 1099.
import java.util.*;

//27th April .. http://codeforces.com/contest/1157

public class codeforces{
		

	public static int functionUno4(int x){
		HashSet<Integer> hs = new HashSet<Integer>();
		hs.add(x);
		while(!hs.contains(functionUno2(x))){
			x = functionUno2(x);
			hs.add(x);
		}

		//Iterator iter = hs.iterator();
		//while (iter.hasNext()) {
		//    System.out.println(iter.next());
		//}
		return hs.size();

	}	

	public static int functionUno3(int y){

		while(y%10 == 0)
			y = y/10;
		return y;


	}
	public static int functionUno2(int x){

		if(((x+1)%10) !=0 )
			return x+1;
		else 
			return functionUno3(x+1);
	}

	public static int functionUno(int x, int flag){
		//Two cases: remove trailing zeros && simple eval

		//simple eval
		if(flag == 0 && (x+1)%10 != 0 )
			return x+1;

		// initiate remove trailing zeros ex. 599.
		else if(flag == 0 && (x+1)%10 == 0 )
			return functionUno((x+1), 1);

		//remove trailing zeros && remove 1 zero
		else if(flag == 1 && (x%10)==0)
			return functionUno(x/10, 1);

		//case remove trailing zeros && print result.
		else if(flag == 1 && x%10!=0)
			return x;
		//idk
		else 
			return x+1;
	}
	public static void main(String args[]){

		Scanner sc = new Scanner(System.in);
		int s1 = sc.nextInt();



		//System.out.println("SUp! ");
//		System.out.println(" ->>  "+functionUno(599, 0));
//		System.out.println(" ->>  "+functionUno(7, 0 ));
//		System.out.println(" ->>  "+functionUno(8, 0 ));
//		System.out.println(" ->>  "+functionUno(10099, 0 ));

//		System.out.println(" ->>  "+functionUno2(599));
//		System.out.println(" ->>  "+functionUno2(7));
//		System.out.println(" ->>  "+functionUno2(8));
//		System.out.println(" ->>  "+functionUno2(10099));

		System.out.print(functionUno4(s1));


	}


}