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
#052_C
n = int(input())
mod = 10 ** 9 + 7

div = [0 for _ in range(n)]
for i in range(1, n+1):
    x = i
    for j in range(2, x+1):
        while x % j == 0:
            x //= j
            div[j-1] += 1
ans = 1
for i in range(n):
    ans = ans * (div[i] + 1) % mod

print(ans)