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 scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int[] divisorList = new int[N];
        int mod = (int) (Math.pow(10, 9) + 7);
        long result = 1;
        for (int i = N; i >= 2; i--) {
            calcNumOfDivisor(i, divisorList);
        }
        for (int i = 0; i < divisorList.length; i++) {
            result = result * (divisorList[i] + 1) % mod;
        }

        System.out.println(result);
    }
    public static void calcNumOfDivisor(int num, int[]divisorList) {
        for (int i = 2; i <= num; i++) {
            while (num % i == 0) {
                divisorList[i - 1]++;
                num /= i;
            }
        }
    }
}