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())
mod=10**9+7

import math
s=math.factorial(n)
i=2
ans=1
cnt=0
while s!=1:
    if s%i==0:
        s//=i
        cnt+=1
    else:
        ans*=(cnt+1)
        cnt=0
        i+=1

print(ans*(cnt+1)%mod)