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 = int(1e9 + 7)
n = int(input())
# es[i] := pi ** es[i]
es = [0] * 1010


def div(x):
    if x == 1: return
    for i in range(2, x + 1):
        while x % i == 0:
            es[i] += 1
            x //= i


for i in range(1, n + 1):
    div(i)

ans = 1
for i in range(1, n + 1):
    ans *= es[i] + 1

print(ans % MOD)