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
public class Main {
    private static java.util.Scanner scanner = new java.util.Scanner(System.in);

    public static void main(String[] args) {
        long n=scanner.nextInt(),a[]=new long[(int)n+1];
        for(int i=2,k=i;i<=n;i++,k=i)for(int j=2;j<=i&&k>1;j++)for(;k%j==0;k/=j)a[j]++;
        System.out.println(java.util.Arrays.stream(a).reduce(1,(l,m)->l*(m+1)%1000000007));
    }
}