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())
p = 10 ** 9 + 7
primes = []
for i in range(1, N + 1):
  for j, prime in enumerate(primes):
    while i % prime[0] == 0:
      primes[j][1] += 1
      i //= prime[0]
    if i < prime[0]:
      break
  if i > 1:
    primes.append([i, 2])
ans = 1
for k, v in primes:
  ans *= v
  ans %= p
print(ans)