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
# -*- coding: utf-8 -*-


N = input()
mod = 10**9+7
num = 1
cnt = 0
ans = 1
for i in range(N):
    num = num*(i+1)
for i in range(N-1):
    while(num%(i+2)==0):
        num = num/(i+2)
        cnt += 1
    ans *= (cnt+1)
    ans = ans % mod
    cnt = 0
    
print(ans)