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.

Examples

Input

3


Output

4


Input

6


Output

30


Input

1000


Output

972926972
n = int(raw_input())
sieve = [True for i in range(n+1)] 
for i in range(2, n+1):
    if sieve[i] == True:
        for j in range(i+i, n+1, i):
            sieve[j] = False
res = 1

for i in range(2, n+1):
    m = 1
    if sieve[i] == False:
        continue
    for j in range(i, n+1):
        j2 = j
        while j2 % i == 0:
            m += 1
            j2 /= i
    res = (res * m) % (10**9+7)
print res