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

LL const N=1009;
LL const MOD=1000000007;

int main(){
	LL n;
	LL fac[N]={0};
	cin>>n;
	for(LL i=2;i<=n;i++){
		LL k=i;
		for(LL j=2;j<=n;j++){
			if(k==1){
				break;
			}
			while(k%j==0){
				k/=j;
				fac[j]++;
				fac[j]%MOD;
			}
		}
	}
	LL sum=1;
	for(LL k=2;k<=n;k++){
		sum*=((fac[k])%MOD+1)%MOD;
		sum %= MOD;
	}
	cout<<sum%MOD<<endl;
	return 0;
}