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<iostream>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int facnum[1001]={};
void factors(int n){
	for(int i=2;i*i<=n;i++){
		if(n%i==0){
			while(n%i==0){
				n/=i;
				facnum[i]++;
			}
		}
	}
	facnum[n]++;
}
int main(){
	int n;
	cin >> n;
	for(int i=2;i<=n;i++){
		factors(i);
	}
	ll ans=1;
	for(int i=2;i<=n;i++){
		if(facnum[i]!=0)ans*=facnum[i]+1;
		ans%=MOD;
	}
	cout << ans << endl;
	return 0;
}
