#pragma GCC optimize("Ofast")
#include<cstdio>
#include<cmath>
//#define ll long long
#define ll __int128
#define maxn 1000005
using namespace std;

const int M=1000000;
const ll mod=998244353,inv2=499122177,inv6=166374059;
ll n,m;
ll tot,prime[maxn],mark[maxn];
ll cnt,id1[maxn],id2[maxn];//将区间映射到连续的数组
ll g[maxn],v[maxn],sum[2][maxn];

void ready(ll m)
{
	for(int i=2;i<=m;++i)
	{
		if(!mark[i])
		{
			prime[++tot]=i;
			sum[0][tot]=(sum[0][tot-1]+i)%mod;
			sum[1][tot]=(sum[1][tot-1]+1LL*i*i%mod)%mod;
		}
		for(int j=1;j<=tot;++j)
		{
			ll x=i*prime[j];
			if(x>M)
			break;
			mark[x]=1;
			if(i%prime[j]==0)
			break;
		}
	}
}

ll getnum(ll n,ll x)
{
	return (x<=m)?id1[x]:id2[n/x];
}

ll f(int fl,ll x)//求f(x)
{
	if(x==1)
	return 0;
	else
	return (fl)?x%mod*x%mod:x%mod;
}

ll sumf(int fl,ll x)//求f(2)+...+f(x)的和
{
	x%=mod;
	ll ret;
	if(fl)
	{
		ret=x%mod*(x+1)%mod*(2*x+1)%mod*inv6%mod;
		ret=(ret+mod-1)%mod;
	}
	else
	ret=(x+2)%mod*(x-1)%mod*inv2%mod;
	return ret;
}

void pre_solve(int fl,ll n)//预处理g数组
{
	for(ll l=1,r;l<=n;l=r+1)
	{
		r=n/(n/l);
		ll val=n/l;
		if(val<=m)
		id1[val]=++cnt;
		else id2[n/val]=++cnt;
		v[cnt]=val;
		g[cnt]=sumf(fl,val);
	}
	for(ll j=1;j<=tot;++j)
	{
		ll x=prime[j];
		for(ll i=1;i<=cnt&&x*x<=v[i];++i)
		{
			g[i]=(g[i]-f(fl,x)*((g[getnum(n,v[i]/x)]-sum[fl][j-1])%mod+mod)%mod)%mod;
			g[i]=(g[i]+mod)%mod;
		}
	}
}

ll getans(int fl,ll n)
{
	cnt=tot=0;
	m=sqrt((long long)n);
	ready(m);
	pre_solve(fl,n);
	return g[getnum(n,n)];
}

int main()
{
	scanf("%lld",&n);
//	n=1e11;
	ll tot=(n+2)%mod*((n-1)%mod)%mod*inv2%mod;
	ll tot2=n%mod*(n+1)%mod*(2*n+1)%mod*inv6%mod;
	tot2=(tot2+mod-1)%mod;
	ll totp=((getans(0,n)-getans(0,n>>1))%mod+mod)%mod;
	ll totp2=((getans(1,n)-getans(1,n>>1))%mod+mod)%mod;
	ll ans=((tot*tot%mod-tot2)%mod+mod)%mod;
	ans=ans*inv2%mod;
	ans=((ans-totp*tot%mod)%mod+mod)%mod;
	ans=(ans+(((totp*totp%mod-totp2)%mod+mod)%mod*inv2%mod)+totp2)%mod;
	printf("%d",(int)ans);
	return 0;
}
/*
7
80
*/