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())
p = 10**9+7
cnt = [0 for i in range(n+1)]


def cnt_factor(n):
    i = 2
    k = n
    while i <= n:
        if k % i == 0:
            k = k // i
            cnt[i] += 1
        else:
            i += 1

for i in range(2, n+1):
    cnt_factor(i)


ans = 1
for i in range(2, n+1):
    ans *= (cnt[i]+1) % p

print(ans % p)