#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

const ll MOD = 998244353;
const ll SIX = 166374059;
const ll TWO = (MOD + 1) / 2;
const ll K = 1000000;

ll sqrsum(ll n) {
    n %= MOD;
    return n * (n + 1) % MOD * (2 * n + 1) % MOD * SIX % MOD;
}

ll sum(ll n) {
    n %= MOD;
    return n * (n + 1) % MOD * TWO % MOD;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    ll n;
    cin >> n;
    ll ans = 0;
    for (ll a = 2; a <= K && a <= n; ++a) {
        for (ll b = a, cnt = 1; b <= n; b *= a, ++cnt) {
            ll r = min(b * a, n + 1);
            ans = (ans + (r - b) * cnt % MOD * a) % MOD;
        }
    }
    if (n > K) { 
        ans = (ans + (n + 1) % MOD * sum(n)) % MOD;
        ans = (ans + MOD - (n + 1) % MOD * sum(K) % MOD) % MOD;
        ans = (ans + MOD - sqrsum(n)) % MOD;
        ans = (ans + sqrsum(K)) % MOD;
    }
    cout << ans << "\n";
}