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;
long long Cnt[1010];
int main()
{
	int N;
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		int Tmp=i;
		for(int j=2;j<=i;j++)
			while(Tmp%j==0)
			{
				Tmp/=j;
				Cnt[j]++;
				//cout<<i<<":"<<j<<"->"<<Cnt[j]<<endl;
			}
	}
	long long Ans=1ll;
	for(int i=2;i<=N;i++)
		Ans=Ans*(Cnt[i]+1ll)%1000000007;
	cout<<Ans<<endl;
	return 0;
}
