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 {
    private static final long mod = (int) (1e9 + 7);

    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = Integer.parseInt(in.nextLine());
            run(N);
        }
    }

    private static void run(int N) {
        int[] countDivisor = new int[N + 1];
        for (int number = 1; number <= N; number++) {

            int n = number;
            for (int divisor = 2; divisor <= n; divisor++) {
                while (n % divisor == 0) {
                    countDivisor[divisor]++;
                    n /= divisor;
                }
            }

        }

        long numDivisors = 1;
        for (int i = 2; i <= N; i++) {
            numDivisors *= (1 + countDivisor[i]);
            numDivisors = numDivisors % mod;
        }

        System.out.println(numDivisors);
    }
}
