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 = [1 for _ in range(1000)]
for i in range(1,n+1):
  now = i
  div = 2
  while now > 1:
    if now % div == 0:
      now //= div
      prime[div-1] += 1
    else:
      div += 1
ans = 1
for i in range(n):
  ans *= prime[i]
  ans %= mod
print(ans)
#print(prime)