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) throws Exception {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] cnt = new int[n + 1];

        sc.close();

        int mod = 1000000007;

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

        long ans = 1;
        for (int num : cnt) {
            ans = (ans * (num + 1)) % mod;
        }

        System.out.println(ans);

    }
}