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;

class Main {
    static final long mod = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long ans = 1;
        long[] cnt = new long[n + 1];
        for (int i = 2; i < n + 1; i++) {
            int tmp = i;
            int j = 2;
            while (tmp != 1) {
                while (tmp % j == 0) {
                    tmp = tmp / j;
                    cnt[j]++;
                }
                j++;
            }
        }
        for (int i = 1; i < n + 1; i++) {
            ans = ans * (cnt[i] + 1) % mod;
        }
        System.out.println(ans);
        sc.close();
    }
}