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;
long long n,pri[1111],ans=1;
long long ced(long long i){
	long long a=0,q=n;
	while(q>=i){
		q/=i;
		a+=q;
	}
	return a;
}
int main(){
	cin>>n;
	pri[0]=1;pri[1]=1;
	for(long long i=2;i<=n;i++){
		if(!pri[i]){
			for(long long j=i+i;j<=n;j+=i)pri[j]=1;
		}
	}
	for(long long i=2;i<=n;i++){
		if(!pri[i]){
			ans*=ced(i)+1;
			while(ans>1e9+7)ans=ans-(1e9+7);
		}
	}
	cout<<ans;
	return 0;
}