Given an integer n, you are asked to calculate the minimum number of steps that would be required to get from n to 0. On each step, you are allowed to subtract one of the digits from the number.

Input

The input contains a single integer n (1 ≤ n ≤ ).

Output

The program should print the minimum number of steps we should take to get from n to 0.