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
data = int(input())
modu = 10 ** 9 + 7
n = 1
for i in range(2, data + 1):
  n *= i
count = 1
ans = 1
for i in range(2, data + 1):
  if n % i != 0:
    continue
  count = 1
  while n % i == 0:
    n //= i
    count += 1
  ans *= count
print(ans % modu)