欧拉函数之和

#include<bits/stdc++.h> 
using namespace std;
#define ll long long 
const int maxs = 5000000;
bool vis[maxs+10];
int prime[maxs+10];
ll phi[maxs+10];
const ll mod=1e9+7;const ll inv=500000004;
map<ll,ll>V;
void Elu()
{
    phi[1]=1;  
    int top = 0;   
    for(int i = 2; i<=maxs;i++)
    {
        if(vis[i]==0)
        {
            prime[top++] = i; 
            phi[i] = i-1;   
        }
        for(int j = 0 ;j<top && i*prime[j]<maxs;j++)
        {
            vis[prime[j]*i] = 1; 
            if(i%prime[j]==0)
            {
                phi[i*prime[j]] = phi[i] * prime[j]; 
                break;
            }
            else
            {
                phi[i*prime[j]] = phi[i] * phi[prime[j]] ;
            }
        }
    }
    for(int i=2;i<=maxs;++i)phi[i]=(phi[i]+phi[i-1])%mod; 
}
ll solve(ll x)
{
	if(x<=maxs)return phi[x];
	if(V[x])return V[x];
	ll ans=(x+1)%mod*x%mod*inv%mod;
	for(long long i=2,r;i<=x;i=r+1)
    {
        r=x/(x/i);
        ans=(ans-solve(x/i)%mod*(r-i+1)%mod)%mod;
    }
    ans=(ans+mod)%mod;
    V[x]=ans;
    return ans;
}
int main()
{
	Elu();
	ll n;
	cin>>n;
	cout<<solve(n)<<endl;
}