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
M = 10 ** 5 + 1
rec = [0] * M
for i in range(1, N + 1):
    k = i
    for j in range(2, N + 1):
        while k >= 2 and k % j == 0:
            k //= j
            rec[j] += 1

num = 1
for k in list(filter(lambda x: x > 0, rec)):
    num *= k + 1
    num %= MOD

print(num)