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())
l = []
ans = 1
for i in range(2,n+1):
    for j in range(2,i):
        if i % j == 0:
            break
    else:
        l.append(i)

for h in l:
    a = 1
    for i in range(1,n+1):
        while i % h == 0:
            i /= h
            a += 1
    else:
        ans *= a

print(ans % (10**9+7))