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())
mod = 10**9+7
memo = {}

for i in range(2, N+1):
    for j in range(2, i+1):
        while i % j == 0:
            i  = i // j
            try:
                memo[j] += 1
            except:
                memo[j] = 1

ans = 1
for key in memo.keys():
    ans *= memo[key] + 1
    ans %= mod

print(ans)
