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
from math import factorial

n=int(input())
fcr=[]
for i in range(1,n+1):
    p=2
    while p*p<=i:
        while i%p==0:
            fcr.append(p)
            i//=p
        p+=1
    if i>1:
        fcr.append(i)
ans=1
s_fcr=set(fcr)
for i in s_fcr:
    ans*=fcr.count(i)+1
print(ans%(10**9+7))