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())
m = 10**9+7
d = {}

for i in range(2, n+1):
  tmp = i
  div = 2
  while tmp > 1:
    if tmp % div == 0:
      if div not in d:
        d[div] = 1
      else:
        d[div] += 1
      tmp //= div
    else:
      div += 1

ans = 1
for div in d:
  ans = ans * (d[div] + 1) % m

print(ans)