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