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;
int mod = 1e9+7;
int count[1001];
void function(int i){
	//iまでを素因数分解していく
	int j = 2;
	while(i!=1){
		if(i%j==0){
			::count[j]++;
			i /=j;
			continue;
		}
		j++;
	}
}
int main(void){
	int N;
	cin >> N;
	long long ans = 1;
	for(int i = 1;i<=N;i++)::function(i);
	for(int i =1;i<=N;i++){
		ans *= (long long)::count[i]+1;
		ans %= (long long)mod;
	}
	cout << ans;
	return 0;
}