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(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)