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())
y = [0]*(N+1)
for i in range(1,N+1):
    M = i
    while M > 1:
        for j in range(2,M+1):
            if M%j == 0:
                M = M//j
                y[j] += 1
                break
ans = 1
for i in y:
    ans = (ans*(i+1))%(10**9+7)
print(ans)