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())
mod = 10**9+7
prime = [2]
for i in range(3,N+1):
  if(all(i%p for p in prime)):
    prime.append(i)

ans = 1
for p in prime:
  tmp = N
  cnt = 0
  while tmp != 0:
    cnt += tmp//p
    tmp //= p
  ans = ans*(cnt+1) % mod
print(ans)
