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
from math import factorial
from collections import defaultdict

n = int(input())
cnt = defaultdict(int)
n = factorial(n)
i = 2
while n >= i:
    if n % i == 0:
        n //= i
        cnt[i] += 1
    else:
        i += 1    
ans = 1
#print(cnt)
for k, v in cnt.items():
    ans *= v + 1

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