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())
F = {}
for n in range(2,N+1):
    _n = n
    f = 2
    while f*f<=_n:
        if n%f==0 and f not in F: F[f] = 0
        while n%f==0:
            n//=f
            F[f]+=1
        f+=1
    if n>1:
        if n not in F: F[n] = 0
        F[n] += 1

ans = 1
mod = 10**9+7
for _, k in F.items():
    ans = ans*(k+1)%mod
print(ans)