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=[]
for k in range(2,n+1):
  flag = True
  for i in p:
    if k%i == 0:
      flag = False
      break
  if flag:
    p += [k]

a = 1
for i in p:
  s = 1
  x = n//i
  while x>0:
    s += x
    x = x//i
  a = a*s%1000000007
print(a)
    