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=[]
for i in range(2,N+1):
    for j in l:
        if i%j==0:
            break
    else:
        l.append(i)
a=1
for i in l:
    t=0
    s=1
    while i**s<=N:
        t+=N//i**s
        s+=1
    a=a*(t+1)%(10**9+7)
print(a)