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())
MOD=10**9+7 
def isp(i):
    if i<=1:
        return 0 
    return all(i%j for j in range(2,int(i**0.5)+1))
ans=1 
def po(x,n):
    c=0 
    while n//x:
        c+=n//x 
        n//=x 
    return c 
for i in range(2,n+1):
    if isp(i): 
        p=po(i,n)
        ans*=(p+1)
        ans%=MOD 
print(ans)
        