#include <bits/stdc++.h>

#define int int64_t

using namespace std;

const int mod = 998244353;

int exp(int a, int e) {
	int m=a;
	int ans=1;
	while(e) {
		if(e&1) ans=(ans*m)%mod;
		m=(m*m)%mod;
		e>>=1;
	}
	return ans;
}
const int m6 = exp(6, mod-2);
int s2(int n) {
	return n * (n+1) % mod * (2*n+1) % mod * m6 % mod;
}
int slow(int n) {
	int ans = 0;
	for(int a=2; a<=n; ++a) {
		int x = 0;
		int ll = -1;
		for(int b=a; b<=n; ++b) {
			int l = int(0.000001 + log(b)/log(a));
			x = (x + l)%mod;
			if(l!=ll) {
				ll=l;
			}
		}
		ans = (ans+a*x)%mod;
	}
	return ans;
}

int fast(int n) {
	int ans=0;
	int a;
	int nm = n%mod;
	for(a=2; a*a<=n; ++a) {
		for(int b=a; b<=n; b*=a) {
			ans=(ans+a*(nm-b+1))%mod;
		}
	}
	//for(; a<=n; ++a) ans = (ans + a*(n-a+1))%mod;
	ans = (ans + (nm+1) * ( ((nm*(nm+1)/2 - a*(a-1)/2) %mod ) )) % mod;
	//for(; a<=n; ++a) ans = (ans + mod - a*a )%mod;
	ans = (ans + mod - s2(nm) + s2(a-1))%mod;
	return ans;
}

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int n;
	cin>>n;
	//cout<<slow(n)<<endl;
	cout<<fast(n)<<endl;
	return 0;
}