For this Question: Sara wants to be the best programmer in the world but today she is 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 first line of input contains a single integer containing the number of test cases T. Next T lines contain a single integer N.

Constraints:-
1 <= T <= 10000
1 <= N <= 1000000For each test case print the number of operations required to make the number 0.Sample Input:-
4
25
8
17
842

Sample Output:-
3
1
2
72

Explanation:-
25 - > 18 - > 9 - > 0
8 - > 0
17 - > 9 - > 0, I have written this Solution Code: import sys
sys.setrecursionlimit(40000)

dic = {}
def sumi(n):
    x = 0
    while(n>0):
        x += n%10
        n //= 10
    return x  

def Num_of_times(n):
    
    if (n==0):
        return 0
    if dic.get(n):
        count = dic[n]
        return count
    else:
        x = sumi(n)
        count = 1+Num_of_times(n-x)
    dic[n] = count
    return count

arr = []  
maxi = 0
for i in range(int(input())):
    x = int(input())
    maxi = max(maxi,x)
    arr.append(x)

maxi_ans = Num_of_times(maxi)
for i in arr:
    if i == maxi:
        print(maxi_ans)
    else:
        print(Num_of_times(i)), In this Programming Language: Python, Now tell me if this Code is compilable or not?