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())
x=[0 for i in range(2,1001)]
def soinsu(a):
    for i in range(2,a+1):
        t=0
        while(a%i==0):
            a/=i
            t+=1
        x[i-2]+=t
for i in range(2,n+1):
    soinsu(i)
a=1
for i in x:
    a*=i+1
    a%=10**9+7
print(a)