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
def main():
    n=int(input())
    a=[0]*(n+1)
    ans=1
    for i in range(1,n+1):
        num=i
        for j in range(2,i+1):
            if num%j==0:
                while num>1 and num%j==0:
                    num//=j
                    a[j]+=1

    for i in a:
        ans=ans*(i+1)%(10**9+7)
    print(ans)
    return

main()