#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    int n; cin >> n;
    if(n > 1200000)return 0;
    vll cnt(n+1, 0); cnt[1] = 1;
    rep2(i, 2, n+1){
        ll len = n-i+1;
        if(len < i){
            cnt[1] += len;
            cnt[2] -= len;
            continue;
        }
        cnt[1] += i;
        
        ll mx = len/i;
        if(len % i == 0){
            cnt[mx+1] -= i;
        }else{
            ll k = i - (len%i);
            cnt[mx+1] -= k;
            cnt[mx+2] -= i-k;
        }
    }

    ll s = 0; mint ans = mint(0);
    rep2(i, 1, n+1){
        s += cnt[i];
        ans += mint(s)*mint(i);
    }cout << ans.val() << endl;

    return 0;
}