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