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
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] pn = new int[n+1];

        for (int i = n; i > 0; i--){
            int tmp = i;
            for(int j=2; tmp != 1;){
                if(tmp % j == 0){
                    pn[j]++;
                    tmp /= j;
                } else {
                    j++;
                }
            }
        }
        long result = 1;
        for(int count : pn){
            result = result * (count + 1)% 1000000007;
        }
        System.out.println(result );
    }
}
