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