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 x in range(1001)]

def devPrime(a):
  cnt=2
  res=a
  while res>1:
    while res%cnt==0:
      res/=cnt
      A[cnt]+=1
    cnt+=1
for i in range(2,N+1):
  devPrime(i)
ans=1
for i in range(len(A)):
  ans*=(A[i]+1)
  ans%=1000000007
print(ans)