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

import static java.lang.System.*;

public class Main {
    public static final long mod = 1_000_000_007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

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

        long cnt = 1;
        for (int i = 1; i < primeNums.length; i++) {
            cnt = (cnt * (primeNums[i] + 1)) % mod;
        }

        out.println(cnt);
    }
}