public static long [] primeFactorizationOfFactorial (long n)
    {
        BigInteger [] primes = sieveOfAtkins.sieveOfPrimesUpToN(BigInteger.valueOf(n));
        long [] exponents = new long [primes.length];
        for (int i=0;i<primes.length;i++)
            exponents[i]=findingTheExponentOfThePrimeFactorFactorial(n, primes[i].longValue());
        return exponents;
    }