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())
sum = 1
dict = {}
for i in range(2, n+1):
    j = 2
    while i > 1:
        if i%j == 0:
            i = i//j
            if j in dict:
                dict[j] += 1
            else:
                dict[j] = 1
            j -= 1
        j += 1
for i in dict.values():
    sum *= (i+1)
print(sum%1000000007)