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 <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef struct pair<int,int> P;
typedef struct pair<int,P> P2;

ll d[1001]={};

int main() {
	int n;
	cin>>n;
	for(int i=2;i<n+1;++i){
		int k=i;
		for(int j=2;j<i+1;++j){
			while(k%j==0){
				k=k/j;
				d[j]++;
			}
		}
	}
	ll res=1;
	for(int i=2;i<n+1;++i){
		if(d[i]>0)res=res*(d[i]+1);
		res=res%1000000007;
	}
	cout<<res<<endl;
	return 0;
}
