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 {
static int mod=(int)1e9+7;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n+1];
Arrays.fill(arr,-1);
arr[0]=0;
arr[1]=0;
for(int i=2;i<=n;i++) {
	 
		if(arr[i]==-1) {
			for(int j=i*i;j<=n;j+=i) {
				arr[j]=0;
		}
	}
}
//for(int i:arr) {
//	System.out.println(i+" ");
//}

long ans=1;
for(int i=0;i<=n;i++) {
	if(arr[i]==-1) {
		int res=0;
		int temp=i;
		while(n>=temp) {
			res+=(n/temp);
			
			temp=temp*i;
		}
		
		ans=(ans*(res+1))%mod;
	}
	
	
	
}
System.out.println(ans);



}
}