#include <bits/stdc++.h>
#include <deque>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = atcoder::modint998244353;
#include <bits/stdc++.h>
using namespace std;
using lint = ll;
lint MOD = 998244353;
//#define //_GLIBCXX_DEBUG

template<typename T>
T modpow(T a, T b, T mod=998244353) {
  T res = 1;
  while (b > 0) {
    if (b&1) (res *= a) %= mod;
    (a *= a) %= mod;
    b >>= 1;
  }
  return res;
}

template<typename T>
T modinv(T n, T mod=998244353) {
  T m = mod, u = 1, v = 0;
  while (m) {
      long long t = n / m;
      n -= t * m; swap(n, m);
      u -= t * v; swap(u, v);
  }
  u %= mod;
  if (u < 0) u += mod;
  return u;
}

mint simple(ll N){
    mint ans=0;
    ll uplimit=-1;
    for(ll i=1;i*i<=N;i++){
        ll up=N/i;
        ll down=N/(i+1);
        mint a=mint(i).pow(down+1);
        mint b=mint(i).pow(up-down);
        if(i==1) ans+=up-down;
        else{
            ans+=a*((b-1)/(i-1));
        }
        uplimit=N/(i+1);
    }
    for(ll i=1;i<=uplimit;i++){
        ans+=mint(N/i).pow(i);
    }
    return ans;
}

ll b2(ll n){
    lint ans = 0;
   for (lint i = 1; i <= n; i++) {
    lint a = n/i;
    lint r = n/a;
    lint len = r-i+1;
    if (a%MOD != 1) ans += modpow(a, i)*(modpow(a, len)-1+MOD)%MOD*modinv(a-1), ans %= MOD;
    else ans += len;
    i = r;
  }
  return ans%MOD;
}


int main() {
  lint n;
  cin >> n;
  cout << b2(n) << '\n';
}