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())
if n == 1:
    print(1)
    exit()
mod = 10**9+7
ans = {}
ans[2] = 0
for i in range(2,n+1):
    for j in ans.keys():
        while i % j == 0:
            ans[j] += 1
            i //= j
    if i != 1:
        ans[i] = 1
k = 1
for i in ans.values():
    k *= i+1
    k %= mod
print(k)