#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
const int N=1000000+5;
int n,cnt=0;
int ss[N]={0};
bool ok[N]={0};
ll ans=1;
int main(){
    freopen ("sakuras.in","r",stdin);
    freopen ("sakuras.out","w",stdout);
    scanf("%d",&n);
    for (int i=2;i<=n;i++){
        if (ok[i]==0){
            ss[++cnt]=i;
        }
        ok[i]=1;
        for (int j=1;j<=cnt&&i*ss[j]<=n;j++){
            ok[i*ss[j]]=1;
            if (i%ss[j]==0)break;
        }
    }
    for (int i=1;i<=cnt;i++){
        int t=ss[i];ll c=0;
        while(t<=n){
            c+=n/t;
            t*=ss[i];
        }
        c=(c*2)%mod;
        ans=(ans*(c+1))%mod;
    }
    printf("%lld\n",ans%mod);
    return 0;
}