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())
soinsu=[]
ans = 1

if N==1:
    print(1)
    exit()

for i in range(2,N+1):
    num_tmp = i
    for j in range(2,i+1):
        while num_tmp%j==0 and num_tmp!=1:
            num_tmp /= j
            soinsu.append(j)

for i in range(2,N+1):
    cnt_tmp = soinsu.count(i)
    if cnt_tmp>0:
        ans *= cnt_tmp+1

print(ans%(10**9+7))