求助本题

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
//const int MOD=998244353;
const int MOD=1e9+7;

int read()
{
	int x=0,y=1;
	char ch=getchar();
	while(ch>'9'||ch<'0') {if(ch=='-') y=-y;ch=getchar();}
	while(ch<='9'&&ch>='0') {x=x*10+ch-'0';ch=getchar();}
	return x*y;
}

int prim[N],E[N],cnt,ans;
bool vis[N];

void getprim(int n)
{
	for(int i=2;i<=n;i++)
	{
		if(!vis[i]) prim[++cnt]=i;
		for(int j=1;j<=cnt&&i*prim[j]<=n;j++)
		{
			vis[i*prim[j]]=true;
			if(i%prim[j]==0) break;
		}
	}
	
}

signed main()
{
	int n=read();
	getprim(n);
	for(int i=1;i<=cnt;i++)
	{
//		printf("prim[%d]=%d,n=%d\n",i,prim[i],n);
		int p=prim[i];
		while(n/p>0)
		{
			E[i]=(E[i]+n/p)%MOD;
			p=(p*prim[i])%MOD;
		}
	}
	for(int i=1;i<=cnt;i++) ans=(ans+((E[i]*2+1)%MOD))%MOD;
	printf("%d\n",ans);
	return 0;
}