Problem:
Score : 300 points

Problem Statement

You are given an integer N.
Find the number of the positive divisors of N!, modulo 10^9+7.

Constraints

1≤N≤10^3

Input

The input is given from Standard Input in the following format:

N

Output

Print the number of the positive divisors of N!, modulo 10^9+7.

Sample Input 1

3

Sample Output 1

4

There are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.

Sample Input 2

6

Sample Output 2

30

Sample Input 3

1000

Sample Output 3

972926972

Solution in Kotlin (1.3.71) (judge verdict: Accepted)

import java.util.*

fun main(args: Array<String>){

    var N = readLine()!!.toInt()
    var ans = 1L
    var base = LongArray(N+1){0}

    for(i in 2 until N+1){
        var tmpN = i
        for(j in 2 until i+1){
            while(tmpN % j == 0){
                tmpN /= j
                base[j]++
            }
        }
    }

    for(i in 1 until N+1){

            ans *= (base[i] +1)
            ans %= (1000000007).toLong()

    }
    println(ans)




}