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())
if n<2:print(1)
else:
  l=[2]
  L=[1]
  for i in range(3,n+1):
    c=0
    for j in range(len(l)):
      if i%l[j]==0:
        c+=1
        while i%l[j]==0:
          i=int(i/l[j])
          L[j]+=1
    if c==0:
      l.append(i)
      L.append(1)
  ans=1
  for k in range(len(L)):
    ans*=(L[k]+1)
    ans=ans%(10**9+7)
  print(ans)