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

#define fuck cout << "fuck "
#define _ << ' ' <<
#define __ << ' '
#define __l << '\n'

#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define Mod(x) ((x) % MOD + MOD) % MOD
#define int long long
#define append push_back
const int INF = 6452864528;
const int N = 1e5 + 10;
const int MatN = 3;
const int MOD = 998244353;
int tin, tinn, tinnn, tmp;
string stin, stinn, stinnn;
int itr;
// ---
// ---
int qpow(int a, int b, int p)
{
	int res = 1;
	while (b)
	{
		if (b & 1)
			res = res * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return res;
}

void solve()
{
	int n;
	cin >> n;
	int ans = 0, zns = n % MOD;
	// for(int n=2;n<100;n++){
	int res = 0;
	for (int a = 2; a <= n; a++)
	{
		int tmp = a;
		int exp = 1;
		int ares = 0;
		if (a * a > n)
		{
			break;
		}
		while (tmp * a <= n)
		{
			ares -= exp * tmp;
			tmp *= a;
			ares += exp * tmp;
			exp++;
		}
		zns = (zns % MOD + a % MOD * (n - a + 1) % MOD);
		ares = (ares + exp * (n + 1 - tmp)) % MOD;
		ares = (ares * a) % MOD;
		// cout<<a _ ares<<endl;
		res = (res + ares) % MOD;
	}
	ans = n % MOD * (n + 1) % MOD * (n + 2) % MOD * qpow(6, MOD - 2, MOD) %MOD;

	cout << ((ans % MOD + res % MOD) % MOD - zns + MOD) % MOD << endl;
	// }
}

signed main()
{
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	// cout<<fixed<<setprecision(3);
	signed o_O = 1;
	// cin>>o_O;
	while (o_O--)
		solve();
	return 0;
}