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;
int n;
int num[1005];
void gen (int x){
	for(int i = 2 ; i <= n ; ++i){
		while(x % i == 0){
			num[i]++;
			x /= i;
		}
	}
}
int main() {
	cin>>n;
	long long  res = 1;
	for(int i = 2 ; i <= n ; ++i)gen(i);
	for(int i = 2 ; i <= n ; ++i)res = (res * (num[i] + 1)) % Mod;
	cout<<res;
	return 0;
}