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 REP(i,N) for(int i=0;i<N;i++)
#define print(S) cout<<S<<endl;
using namespace std;
long long int hist[1001]={0};
long long int kosu;
void soiusu(int N){
	for(int i=2;i<=N;i++){
		if(N%i==0){
			hist[i]++;
			N/=i;
			i--;
		}
	}
}
int main() {
	int N;
	kosu=1;
	long long int a,waru= 1000000007;
	cin>>N;
	for(int i=2;i<=N;i++){
		soiusu(i);
	}
	for(int i=2;i<=N;i++){
		kosu*=(hist[i]+1);
		kosu%=waru;
	}
	print(kosu);
	return 0;
}