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 collections import Counter
n=int(input())
l=[]
for i in range(2,n+1):
    k=2
    t=i
    while k*k<=t:
        if t%k==0:
            l.append(k)
            t=t//k
        else:k+=1
    if n>0:l.append(t)

c=Counter(l)
ans=1
for key,value in c.items():
    ans*=value+1
print(ans%(10**9+7))

