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())
d=dict()
for i in range(n+1):
    while i>1:
        for j in range(2,i+1):
            if i%j==0:
                d[j]=d.get(j,0)+1
                break
        i=i//j
ans=1
for i in d:
    ans=(ans*(d[i]+1))%(10**9+7)
print(ans)