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

public class Main {
    public static void main(String args[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] factor = new int[N+1];
        
        for(int num = 2; num <= N; num++) {
            int n = num;
            for(int i = 2; i * i <= n; i++) { //寻找质因子
                while(n % i == 0) {
                    factor[i]++;
                    n /= i;
                }
            }
            if(n != 1)
                factor[n]++;
        }
        
        long ans = 1;
        for(int a : factor) {
            ans = ans * (a + 1) % 1000000007;
        }

        System.out.println(ans);
    }

}   