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) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        HashMap<Integer, Integer> countPrimeFactor = new HashMap<>();
        for(int i = 1; i <= n; i++) {
            int num = i;
            while(num > 1) {
                for(int j = 2; j <= num; j++) {
                    if(num % j == 0) {
                        countPrimeFactor.put(j, countPrimeFactor.getOrDefault(j, 0) + 1);
                        num /= j;
                        break;
                    }
                }
            }
        }
        long count = 1;
        long mod = 1000000007;
        for(int primeNum: countPrimeFactor.values()) {
            count *= (primeNum + 1);
            count %= mod;
        }
        System.out.println(count);
    }

}
