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())
primes = [2,3,5,7,11,13,17,19,23,29,31,37]
mod=int(1e9+7)

memo={}
for n in range(1,N+1):
  for p in primes:
    while not n%p:
      memo[p] = memo.get(p,0)+1
      n=n//p
  if n!=1:
    memo[n] = memo.get(n,0)+1

#print(memo)

answer=1
for v in memo.values():
  answer =answer * (v+1) %mod
print(answer)