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())
data=[0]*(n+1)
for i in range(2,n+1):
    while i%2==0:
        i//=2
        data[2]+=1
    j=3
    while i>1:
        if i%j==0:
            i//=j
            data[j]+=1
        else:
            j+=2
ans=1
mod=10**9+7
for i in range(n+1):
    if data[i]!=0:
        ans=ans*(data[i]+1)%mod
print(ans)