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())
num = 1
factors = []

for i in range(N, 1, -1):
    num *= i

r = 2
while num != 1:
    x = 0
    while num % r == 0:
        num //= r
        x += 1
    if x:
        factors.append(x)
    r += 1

result = 1
for i in factors:
    result *= i+1

print(result % ((10**9)+7))