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())

t = [0] * (n+1)
for j in range(2, n+1):
  y = j
  for i in range(2, n+1):
    while y % i == 0:
      t[i] += 1
      y = y//i
ans = 1
p = 10**9 + 7
for i in t:
  if i != 0:
    ans *= (i+1)
    ans %= p
print(ans)