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
n_prime = [[2,0]]
x = 1
ans = 1
for i in range(2,n+1):
  for j in range(x):
    while(i % n_prime[j][0] == 0):
      n_prime[j][1] += 1
      i /= n_prime[j][0]
  if i != 1:
    n_prime.append([i,1])
    x += 1
for k in range(x):
  ans = ans * (n_prime[k][1]+1) % mod
print(ans)