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
// C - Factors of Factorial
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007

map<int, int> prime_count;

int div_counter(int n, int d){
	for(; n%d==0; n/=d) prime_count[d]++;
	return n;
}

int main(){
	int N; cin>>N;
	for(int i=N; i>1; i--){
		int n = div_counter(i,2);
		for(int d=3; n!=1; d+=2) n = div_counter(n,d);
	}

	long long ans = 1;
	for(auto e:prime_count) ans = ans * (e.second+1) % MOD;
	cout<< ans <<endl;
}