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())
a = [1] * n
ans = 1

for i in range(1,n+1):
    b = 2
    
    while i != 1:
        if i % b == 0:
            i //= b
            a[b-1] += 1
        else:
            b += 1
            
for i in a:
    if 1 < i:
        ans *= i
        ans %= 10**9 + 7
            
print(ans)