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