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;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin >> n;
	vector<int> a(n+1);
	rep(i,n+1){
		int k=i;
		for(int j=2;j<=k;++j){
			while(k%j==0){
				a.at(j)++;
				k/=j;
			}
		}
	}
	ll ans=1,mod=1000000007;
	rep(i,n+1){
		ans*=a.at(i)+1;
		ans%=mod;
	}
	cout << ans << endl;
}