#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

int main(){
  using ll=long long;
  using mint=atcoder::modint998244353;
  ll n;
  cin>>n;
  mint ans=0;
  ll b=sqrt(n);
  for (ll i=1;n/i>b;i++) ans+=mint(n/i).pow(i);
  for (ll i=b;i>=1;i--){
    ll l,r;
    r=n/i;
    l=n/(i+1);
    l++;r++;
    if (i==1) ans+=r-l;
    else ans+=mint(i).pow(l)*(1-mint(i).pow(r-l))/(1-i);
  }
  cout<<ans.val()<<endl;
}