#include<bits/stdc++.h>
using namespace std;
const int mod=1000000007;
int n,v[1000010]={0},prime[100010]={0},ans=1;
int cnt=0;
int pr(int x)
{
	memset(v,0,sizeof(v));
	for(int i=2;i<=x;i++)
	{
		if(v[i]==0){
		v[i]=i;
		prime[++cnt]=i;
		}
		for(int j=1;j<=cnt;j++)
		{
			if(prime[j]*i>x||prime[j]>v[i])break;
				v[i*prime[j]]=prime[j];
		}
	}
}
int main(){
    freopen("sakuras.in","r",stdin);
    freopen("sakuras.out","w",stdout);
    cin>>n;
    pr(n);
    for(int i=1;i<=cnt;i++){
        long long c=0,t=prime[i];
        while(t<=n)
        {
            c+=n/t;
            t=t*prime[i];
        }
        c=(c*2)%mod;
        ans=(ans*(c+1))%mod;
    }
    cout<<ans<<endl;
    return 0;
}