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
num = int(input())
cnt_list = [0] * (num+1)
ans = 1

for i in range(2,num+1):
    x = i
    prime = 2
    while x > 1:
        while x%prime == 0:
            cnt_list[prime] += 1
            x = x//prime
        prime += 1

for i in cnt_list:
    ans = (ans*(i+1)) % (10**9+7)
print(ans)