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())
ans = 1
mod = 1000000007

a = [0 for i in range(n+1)]

for i in range(2,n+1):
    b = i
    for j in range(2,i+1):
        while b%j==0:
            a[j]+=1
            b//=j

for i in range(2,n+1):
    if a[i]>0:
        ans *= a[i]+1
        ans %= mod

print(ans)