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
#include <stdio.h>
int main(){
	int n,i,j,c[1002],t;
	long ans=1;
	scanf("%d",&n);
	for(i=1;i<=1000;i++)
	c[i]=0;
	for(i=1;i<=n;i++){
		t=i;
		j=2;
		while(t!=1){
			if(t%j==0){
				c[j]++;
				t=t/j;
				j=1;
			}
			j++;
		}
	}
	for(i=1;i<=n;i++){
    	ans=ans*(c[i]+1);
    	ans=ans%1000000007;
    }
    printf("%d",ans);
    return 0;
 }