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())

histogram = [0] * (n + 1)
for i in range(2,n+1):
    x = i
    p = 2
    while x > 1:
        while x % p == 0:
            histogram[p] += 1
            x //= p
        p += 1
answer = 1
for a in filter(lambda x:x>0,histogram):
    answer = (answer * (a+1)) % (1e9+7)
print(int(answer))
