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<bits/stdc++.h>
using namespace std;
int a[10010];
void fj(int x){
	int d;
	for(d=2;d<=x;d++){
		while(x%d==0){
			x/=d;a[d]++;
		}
	}
	if(x!=1) a[x]++;
}
int main(){
	long long n,i;
	cin>>n;
	for(i=2;i<=n;i++){
		fj(i);
	}
	long long ans=1;
	for(i=2;i<=n;i++){
		if(a[i]!=0){
			ans*=a[i]+1;
			ans%=1000000007ll;
		}
	}
	cout<<ans;
	return 0;
}