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
from collections import defaultdict

INF = 10 ** 9 + 7
N = int(input())

d = defaultdict(int)
for i in range(1, N + 1):
    for j in range(2, int(i ** 0.5) + 1):
        while i % j == 0:
            d[j] += 1
            i //= j
    if i > 1:
        d[i] += 1
ans = 1
for i in d.values():
    ans *= (i + 1)
    ans %= INF

print(ans)