You are given an integer . On each step, you may subtract from it any one-digit number that appears in it.
How many steps are required to make the number equal to ?
One integer ( ≤ ≤ 10^6).
Print the minimum number of steps to get the number .
Example 1
For =
An optimal solution is → → → → → .