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.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long mod = (long) Math.pow(10, 9) + 7;

        long[] prime = new long[n + 1];
        for (int i = 2; i <= n; i++) {
            int num = i;
            for (int j = 2; j <= n; j++) {
                while (num % j == 0) {
                    prime[j] = (prime[j] + 1) % mod;
                    num /= j;
                }
            }
        }

        long count = 1;
        for (int i = 1; i < prime.length; i++) {
            count = (count * (prime[i] + 1)) % mod;
        }
        System.out.println(count);
    }

}
