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
MOD = 10 ** 9 + 7
N = int(input())
C = [0] * (N + 1)
for i in range(2, N+1):
    k = i
    for j in range(2, i+1):
        while k % j == 0:
            k //= j
            C[j] += 1
        if k == 1:
            break
ans = 1
for c in C:
    ans *= (c + 1)
    ans %= MOD
print(ans)