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
MOD = 10 ** 9 + 7

n = int(input())

S = [0] * (n+1)

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

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

print(ans % MOD)