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>
typedef long long ll;
using namespace std;
#define badi_val 1000000007
int n;
int pd[1100];
const int mo=1e9+7;
int main(){
	scanf("%d",&n);
	for (int i=2;i<=n;i++)
		for (int j=i+i;j<=n;j+=i) pd[j]=1;
	int ans=1;
	for (int i=2;i<=n;i++)
		if (pd[i]==0){
			int tot=0;
			for (int j=i;j<=n;j*=i) tot+=n/j;
			ans=1ll*ans*(tot+1)%mo;
		}
	cout<<ans<<endl;
}