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())
mod = 10**9+7
fact = {}
for j in range(2, N+1):
    for i in range(2, j+1):
        while j % i == 0:
            if i in fact.keys():
                fact[i] += 1
            else:
                fact[i] = 2
            j //= i
ans = 1
for v in fact.values():
    ans *= v
    ans %= mod
print(ans)
