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())
l=[0]*n
for i in range(1,n+1):
    b=2
    while b<=i:
        while i%b==0:
            i//=b
            l[b-1]+=1
        b+=1
#print(l)
x=1
for i in l:
    if i!=0:
        x=x*(i+1)%(10**9+7)
print(x)