#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(){
    ll n; cin >> n;
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    mint ans = mint(0);
    ll w = 1;
    while(w*w <= n){
        ans += mint(n/w).pow(w);
        w++;
    }

    while(w <= n){
        ll k = n/w;
        if(k == 1){
            ans += mint(n-w+1);
            break;
        }
        ll l = w, r = n;
        ll mid;
        while(r-l > 1){
            mid = (r+l)/2;
            if(n/mid == k){
                l = mid;
            }else{
                r = mid;
            }
        }
        ll len = r-w;
        ans += mint(k).pow(w)*((mint(k).pow(len) - mint(1))/(mint(k-1)));
        w = r;
    }cout << ans.val() << endl;

    return 0;
}