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
ans=1
from math import factorial
f=factorial(n)
p=[2]
for i in range(2,1001):
    flag=0
    for j in p:
        if i%j==0:
            flag=1
            break
    if flag==1:
        continue
    p.append(i)
for i in p:
    k=0
    while f%i**k==0:
        k+=1
    ans=ans*k
print(ans%mod)