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())
pList={}
mod = 10**9+7
def soinsuu(x):
    if x==1:return
    for p in pList:
        if x%p==0:
            pList[p] += 1
            return soinsuu(x//p)
    pList[x] = pList.get(x,0)+1
    return
for n in range(2,N+1):
    soinsuu(n)
ans = 1
for i in pList.values():
    ans = (ans*(i+1))%mod
print(ans)