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
from collections import defaultdict
MOD = 10**9+7
N = int(input())
ans = 1
ary = defaultdict(int)
for i in range(1, N+1):
    n = i
    m = 2
    while n > 1:
        if not n % m:
            ary[m] += 1
            n //= m
            m = 1
        m += 1
for v in dict(ary).values():
    ans *= v+1
    ans %= MOD
print(ans)
