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())
cnt = [0]*(n+1)
for i in range(2,n+1):#2~n
    s = i
    while s != 1:
        for j in range(2,n+1):#2~n
            if s % j == 0:
                s //= j 
                cnt[j] += 1
                break

c = 1
for i in range(2,n+1):
    c *=(cnt[i]+1)
    c %=(10**9+7)

print(c)