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())

mul_num = [1]*(N+1)
#print(mul_num)
for i in range(N,2,-1):
    #print(i)
    for j in range(2,i):
        if i%j==0:
            mul_num[int(i/j)] += mul_num[i]
            mul_num[j] += mul_num[i]
            mul_num[i] =0

#print(mul_num)
ans=1
for i in mul_num[2:]:
    if i>0:
      ans *= (i+1)
print(ans%(10**9+7))