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;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n + 1];
        long c = 1;
        for (int i = 2; i <= n; i++) {
            int m = i;
            for (int j = 2; j <= i; j++) {
                while (m % j == 0) {
                    m /= j;
                    a[j]++;
                }
            }
        }
        for (int i = 2; i <= n; i++) {
            c = c * (a[i] + 1) % 1000000007;
        }
        System.out.println(c);
    }
}