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())
e = [0 for _ in range(N + 1)]

for x in range(2, N + 1):
    for p in range(2, x + 1):
        while x % p == 0:
            x //= p
            e[p] += 1

a = tuple(filter(lambda v: v > 0, e))
# print(a)
t = 1
for aa in a:
    t *= (aa + 1)
    t %= MOD
print(t)
