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) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n+1];
        for (int i = 2; i <= n; i++) {
            int x = i;
            for (int j = 2; j <= i; j++) {
                while(x % j == 0){
                    a[j]++;
                    x /= j;
                }
                if(x < 2) break;
            }
        }
        long ans = 1L;
        for (int i = 2; i < n+1; i++) {
            if(a[i] > 0) ans = ans * (a[i] + 1) % 1_000_000_007;
        }
        System.out.println(ans);
        sc.close();
    }

}
