https://www.acwing.com/problem/content/1296/
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
const int mod=1e9+7;
typedef long long int LL;
LL prime[N],st[N],cnt,n;
void init()
{
for(int i=2;i<=1e6;i++)
{
if(!st[i]) prime[cnt++]=i;
for(int j=0;prime[j]<=1e6/i;j++)
{
st[prime[j]*i]=1;
if(i%prime[j]==0) break;
}
}
}
int main(void)
{
init();
cin>>n;
LL ans=1;
for(int i=0;i<cnt;i++)
{
LL s=0,p=prime[i];
for(int j=n;j;j/=p) s+=j/p;
ans=(ans*(s*2%mod+1))%mod;
}
cout<<ans;
return 0;
}