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())
M=1
ans=1
for i in range(N):
    M*=(i+1)
for k in range (2,N+1):
    u=1
    while M%k==0:
        M=M//k
        u+=1
    ans*=u
print(ans%(10**9+7))
        