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;

#define ll long long
const ll INF=1e9+7;

int n;
int p[1001];

int c(int i){
	int a=0,b=n;
	while (b>=i){
		b/=i;
		a+=b;
	}
	return a;
}

int main(){
	cin>>n;
	for (int i=2;i<=1000;i++)
		if (!p[i])
			for (int j=i+i;j<=1000;j+=i)
				p[j]=1;
	ll ans=1;
	for (int i=2;i<=n;i++)
		if (!p[i]){
			ans*=c(i)+1;
			ans%=INF;
		}
	cout<<ans<<endl;
	return 0;
}