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())
lis = [i for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
for i in range(2, n + 1):
    for j in range(i, n + 1, i):
        while lis[j] % i == 0:
            cnt[i] += 1
            lis[j] //= i
ans = 1
for i in cnt:
    ans = ans * (i + 1) % 1000000007
print(ans)
