难推，建议自己推一下

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MOD = 1e9+7,N = 1e6+10;

int n,tot;
int prime[N],res[N];
bool vis[N];

void oula(int n)//欧拉筛 
{
	for(int i=2;i<=n;i++)
	{
		if(!vis[i]) prime[++tot] = i;
		for(int j=1;j<=tot && prime[j]*i<=n;j++)
		{
			vis[i*prime[j]] = true;
			if(i%prime[j]==0) break;
		}
	}
}

signed main()
{
	cin >> n;
	oula(n);
	int ans = 1;
	for(int i=1;i<=tot;i++)
	{
		int j = prime[i];
		while(j<=n)
		{
			res[i]+=(n/j);
			j*=prime[i];
		}
		res[i]%=MOD;
		ans*=(res[i]<<1|1)%MOD;
		ans%=MOD;
	}
	cout << ans;
	return 0;
}