#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 998244353;
const int N = 2e6;

int add(int a, int b)
{
	return (a + b < mod) ? (a + b) : (a + b - mod);
}
int sub(int a, int b)
{
	return (a - b >= 0) ? (a - b) : (a - b + mod);
}
int mult(int a, int b)
{
	return a * (LL) b % mod;
}

const int m2 = (mod + 1) / 2;
const int m6 = (mod + 1) / 6;
int s1(LL n)
{
	n %= mod;
	return mult(mult(n, n + 1), m2);
}
int s2(LL n)
{
	assert(mult(m6, 6) == 1);
	n %= mod;
	return mult(mult(n, n + 1), mult(2 * n + 1, m6));
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	LL n;
	cin >> n;
	
	int ans = 0;
	for(int a = 2; a <= n && a < N; a++)
	{
		int sum = 0;
		LL pw = a;
		while(pw <= n)
		{
			sum = add(sum, (n + 1 - pw) % mod);
			pw *= a;
		}
		ans = add(ans, mult(a, sum));
	}
	//a є [N, n];
	if(n >= N)
	{
		ans = add(ans, mult((n + 1) % mod, sub(s1(n), s1(N - 1))));
		ans = sub(ans, sub(s2(n), s2(N - 1)));
	}
	cout << ans << endl;
	
	
	return 0;
}