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())
es = [0] * 1001
ans = 1

def div(n):
    b = 2
    while b <= n:
        while n%b==0:
            n //= b
            es[b] += 1
        b += 1

for i in range(1,N+1):
    div(i)

for e in es:
    ans *= e + 1
    ans %= 10**9+7
print(ans)