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: import java.io.*;
import java.util.*;



class Main {
	        static Vector<Integer> allPrimes=new Vector<Integer>();
    public static void main (String[] args) throws IOException {


            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int n = Integer.parseInt(br.readLine());



            System.out.println(factorialDivisors(n));
    }

 static void sieve(int n){




        boolean []prime=new boolean[n+1];

        for(int i=0;i<=n;i++)
        prime[i]=true;


        for (int p=2; p*p<=n; p++)
        {


        if (prime[p] == true)
        {

            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
        }

            for (int p=2; p<=n; p++)
                if (prime[p])
                    allPrimes.add(p);
        }


        static long factorialDivisors(int n)
        {
            sieve(n);


            long result = 1;



            for (int i=0; i < allPrimes.size(); i++)
            {

                long p = allPrimes.get(i);




                long exp = 0;
                while (p <= n)
                {
                    exp = exp + (n/p);
                    p = p*allPrimes.get(i);
                }



                result = result*(exp+1);
            }


            return result;
        }



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