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 = [0]*(N+1)
Q = 10**9 + 7
for i in range(1,N+1):
    n = i
    for j in range(2, int( N**(1/2))+1):
        while n%j == 0:
            F[j] += 1
            n //= j
    if n != 1:
        F[n] += 1
ans = 1
for i in range(N+1):
    ans *= F[i]+1
    ans %= Q
print(ans)
