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
ans = 1
L = [0] * (n+1)
for i in range(2, n+1):
    f = i
    for j in range(2, i+1):
        while f != 1 and f % j == 0:
            f //= j
            L[j] += 1

# print(L)

for i in range(2, len(L)):
    if L[i] > 0:
        ans = (ans * (L[i]+1)) % mod
print(ans)