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 PyPy3 (2.4.0) (judge verdict: Accepted)

n = int(input())

v = [2]
for i in range(3,n+1):
    sosu = True
    for j in v:
        if i%j == 0:
            sosu = False
    if sosu:
        v.append(i)


ans = 1
for j in v:
    count = 0
    for i in range(1,n+1):
        while i%j == 0:
            count += 1
            i= i//j
    ans = (ans * (count+1))%(10**9+7)
print(ans)