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())
A = [0 for i in range(1001)]
mod = 10 ** 9 + 7
for n in range(2, N+1):
  m = n
  k = 2
  while m > 1:
    while m % k == 0:
      m //= k
      A[k] += 1
    k += 1
ans = 1
for i in range(1, 1001):
  ans = ans * (A[i] + 1) % mod
print(ans)