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())
prime = []
l = [False] * (N+1)

for i in range(2, N+1):
  if l[i]: continue
  prime.append(i)
  j = 1
  while i * j <= N:
    l[i * j] = True
    j += 1

ans = 1
for i in prime:
  r = 1
  j = 1
  while i ** j <= N:
    k = 1
    while i ** j * k <= N:
      r += 1
      k += 1
    j += 1
  ans = ans * r % (10 ** 9 + 7)

print(ans)