For this Question: Given a integer N, your task is to calculate the number of divisors in factorial of N.Input contains a single integer depicting value of N.

Constraints:-
1 < = N < = 100Print the number of divisors in N!.Sample Input:-
3

Sample Output:-
4

Sample Input:-
5

Sample Output:-
16, I have written this Solution Code: n=int(input())
prime=[True for i in range(n+1)]
p=2
while(p*p<=n):
    if prime[p]:
        for i in range(p*p,n+1,p):
            prime[i]=False
    p+=1
ans=1
for i in range(2,n+1):
    if prime[i]:
        x=n
        e=0
        while x>0:
            x=x//i
            e+=x
        ans*=(e+1)
print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not?