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());
#prime number
P = [0]*N;
#divisor
D = 1;
if N>=2:
    for i in range(2,N+1):
        for j in range(2,i+1):
            while i%j ==0:
                P[j-1] = P[j-1]+1;
                i = i/j
for i in range(N):
    D = D*(P[i]+1)
print(D%1000000007);