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>
#define int long long
#define inf 1000000007
using namespace std;
int cnt[1000];

signed main() {
	int n,ans=1;
	cin>>n;
	for(int i=2;i<=n;i++){
		int x=i,a=2;
		while(a*a<=x){
			if(x%a==0){
				cnt[a]++;
				cnt[a]%=inf;
				//cout<<a<<endl;
				x/=a;
			}
			else{
				a++;
			}
		}
		cnt[x]++;
		cnt[x]%=inf;
		//cout<<x<<endl;
	}
	for(int i=1;i<=1000;i++){
		ans*=(cnt[i]+1)%inf;
		ans%=inf;
		//cout<<cnt[i]<<endl;
	}
	cout<<ans<<endl;
}
