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

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] factors = new long[n+1];
        for (int i = 2; i <= n; i++) {
            int trg = i;
            int prime = 2;
            while (trg != 1) {
                if (trg % prime == 0) {
                    factors[prime]++;
                    trg /= prime;
                }
                else {
                    while (++prime<trg)
                        if (factors[prime] != 0)
                            break;
                }
            }
        }
        int mod = (int)1e9+7;
        long res = Arrays.stream(factors).reduce(1l, (a, b) -> (a*(b+1l)) % mod);
        System.out.println(res);
    }
}
