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
is_prime = [True for i in range(10**3+1)]
is_prime[0] = is_prime[1] = False
primes = []
for i in range(2, len(is_prime)):
    if is_prime[i]:
        primes.append(i)
        for j in range(i*2, len(is_prime), i):
            is_prime[j] = False

prime_num_mapping = {p: 0 for p in primes}
def count(x):
    for p in primes:
        while x % p == 0:
            prime_num_mapping[p] += 1
            x /= p
        if x == 1:
            break
ans = 1
N = int(raw_input())
for x in range(N, 0, -1):
    count(x)
for k, v in prime_num_mapping.items():
    ans = (ans * (v+1)) % (10**9+7)
print ans