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 mod = 1e9+7;
long long A[1001];
 
int main(){
	long long n,a,sum=1;;
	cin >> n;
	
	for(int i=2;i<=n;i++){
		a=i;
		for(int j=2;a>1;j++){
			while(a%j==0){
				A[j]++;
				a/=j;
			}
		}
	}
	
	for(int i=2;i<=n;i++){
		sum = (sum*(A[i]+1))%mod;
	}
	cout << sum << endl;
	return 0;
}