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
p=[]
for k in range(2,n+1):
  f=1
  for i in p:
    if k%i==0:
      f=0
      break
  if f==1:
    p+=[k]
l=[1]*len(p)
for i in range(len(p)):
  d=p[i]
  x=n//d
  while x>0:
    l[i]+=x
    x//=d
a=1
for i in l:
  a*=i
  a%=m
print(a)