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())
pf = {}
mod = 10**9 + 7

for m in range(1, n + 1):
    for i in range(2, int(m**0.5) + 1):
        while not m % i:
            pf[i] = pf.get(i, 0) + 1
            m //= i
    if m > 1:
        if m in pf:
            pf[m] += 1
        else:
            pf[m] = 1

res = 1
for i, j in pf.items():
    res *= j + 1
print(res % mod)