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;
const int M = 1e9+7;
unordered_map<int,int> mapa;
typedef long long ll;
int main(){
	int n;
	cin >> n;
	for(int i = 1;i<=n;i++){
		int atual=i;
		for(int j = 2;j*j<=atual;j++){
			while(atual%j == 0){
				mapa[j]++;
				atual/=j;
			}
		}
		if(atual!=1)
			mapa[atual]++;
	}
	ll ans = 1;
	for(auto it: mapa){
		if(it.first!=1){
			ans*=(it.second+1);
			ans%=M;
		}
	
	}
	cout<<ans;
}