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())
Index=[0]*(N+1)
ans=1
Divider=pow(10,9)+7
for i in range(N+1):
    for j in range(i+1):
        if j>1:
            while i%j==0:
                i=int(i/j)
                Index[j]+=1
#print(Index)
for i in range(N+1):
    ans=ans*(Index[i]+1)%Divider
print(ans)