For this Question: Yogi wants to be the best programmer in the world but today she stuck on an easy problem. Help her to solve it. 

<b>Problem description:-</b>
Choose an integer N and subtract the sum of digits of the number N from it i.e. if N is 245 then subtract 2+4+5 from it making it 245 - 11 = 234.
Keep on doing this operation until the number becomes 0 (for eg. 25 requires 3 operations to reduce to 0 
25 -> 18 -> 9 -> 0).

Given a number N, your task is to print the number of operations required to make the number 0.The input contains a single integer N.

<b>Constraints:-</b>
1 <= N <= 10000Print the number of operations required to make the number 0.Sample Input:-
25

Sample Output:-
3

Explanation:-
25 -> 18 -> 9 -> 0

Sample Input:-
4

Sample Output:-
1, I have written this Solution Code: import java.util.Scanner;

class Main{
    public static void main (String[] args) {
       Scanner sc=new Scanner(System.in);
       int n=sc.nextInt();
       int count=0;
       while(n!=0){
           int sum=digitsum(n);
           n=n-sum;
           count++;
       }
       System.out.println(count);
    }
    public static int digitsum(int n){
        int s=0,r;
        while(n>0){
            r=n%10;
            s=s+r;
            n=n/10;
        }
        return s;
    }

}, In this Programming Language: Java, Now tell me if this Code is compilable or not?