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.io.*;
import java.util.*;
public class Main {
    
    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int n=Integer.parseInt(br.readLine());
        int[] x=new int[n+1];
       int[] prime=new int[n+1];
        Arrays.fill(prime,1);
        prime[0]=prime[1]=0;
        for(int i=2;i*i<=n;i++){
            if(prime[i]>0){
                for(int j=2;i*j<=n;j++){ prime[i*j]=0; }
            }
        }
        
        for(int i=2;i<n+1;i++){
            if(prime[i]>0){
                prime[i]=0;
                for(int j=i;j<=n;j*=i){
                    prime[i]+=n/j;
                }
            }
        }for(int i=0;i<n+1;i++){ prime[i]++; }
        
        long sum=1;
        
        for(int i=0;i<n+1;i++){
            sum=(sum%1000000007)*(prime[i]%1000000007);
        }System.out.println(sum%1000000007);
        
        
    }
}