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())
d={}
for x in range(2,n+1):
  while x%2<1:
    x//=2
    d[2]=d.get(2,0)+1
  for i in range(3,int(x**0.5)+1,2):
    while x%i<1:
      x//=i
      d[i]=d.get(i,0)+1
    if x<2: break
  if x>1: d[x]=d.get(x,0)+1
a=1
for v in d.values(): a=a*(v+1)%(10**9+7)
print(a)