#include<bits/stdc++.h>
using namespace std;
#define INF 1e18
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const int inf = (int)1e9; 

//const ll N = 1000000007;
const ll N = 998244353;

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

int main(void){
    ll n;
    cin>>n;
    ll I = 2;
    ll ans = 0;
    for(;I*I<=n;I++){
        ll t = n;
        for(;;){
            ans= (ans+t%I)%N;
            t=t/I;
            if(t<I){
                ans=(ans+t)%N;
                break;
            }
        }
    }
    ll level = n;
    ll INV = inv(2LL,N-2);
    for(ll i=1;i<=I;i++){
        //cout<<ans<<endl;
        ll t = n/i;
        if(t*t<=n)continue;
        if(i == 1){
            ll s = n/(i+1);
            ll l = (level-s)%N;
            ans = (ans+l+N)%N;
            ll r1 = n%(level);
            ll r2 = n%(s+1); 
            ll r = (r1+r2)%N;
            ll tmp = (l*r)%N;
            tmp = (tmp*INV)%N;
            ans = (ans+tmp)%N;
            level = s;
            continue;
        }
        ll s = n/(i+1);
        ll l = (level-s)%N;
        ans = ((l*i)%N+ans+N)%N;
        ll r1 = n%(level);
        ll r2 = n%(s+1);
        ll r = (r1+r2)%N;
        ll tmp = (l*r)%N;
        tmp = (tmp*INV)%N;
        ans = (ans+tmp)%N;
        ans = (ans+N)%N;
        level = s;
    }
    cout<<ans<<endl;
    return 0;
}