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())

INF = 10**9 + 7

s = [0] * (n+1)

for i in range(1, n+1):
    ni = i
    p = 2
    while ni > 1:
        while ni % p == 0:
            ni //= p
            s[p] += 1
        p += 1

ans = 1
for i in s:
    ans *= i+1

print(ans % INF)