#include<bits/stdc++.h>

using namespace std;

using lint = int64_t;

unordered_map<lint, lint> memo;

lint solve(lint x){
  if(x == 1) return 1;
  if(memo.count(x)) return memo[x];
  lint &ans = memo[x];
  ans = 1;
  for(lint a =1, b; a<=x; a=b+1){
    b = x / (x/a);
    lint A = max<lint>(2, a);
    lint B = min<lint>(b, 20210926);
    ans += ( (B-A+1) % 998244353 )* solve(x/a);
    ans %= 998244353;
  }
  return ans;
}

int main(){
  lint n; cin>>n;
  cout<<solve(n)<<"\n";


}