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

#define rep(i,a,b) for (int i = a; i < b; i++)
#define all(x) begin(x),end(x)
#define trav(a, b) for (auto a : b)
#define lld long long
#pragma GCC optimize("-O3","unroll-loops")
using i64 = long long; 
const int MOD=998244353;
const int MAX=10'000'000;
int pref[2*MAX];
int DP[MAX];
const int CHATO=20210926;
int red(int &x){
  if(x>=MOD)x-=MOD;
  if(x<0)x+=MOD;
  return x;
}
map<lld,int> V;
void calcset(lld x){
  V[x]++;
  for(int i=2;(x/i)>=MAX;i++){
    calcset(x/i);
  }
}
void solve() {
  lld n;
  cin>>n;
  if(n<MAX){
    cout<<DP[n]<<"\n";
    return;
  }
  calcset(n);
  vector<pair<int,int> >X;
  trav(a,V)X.push_back(a);
  lld ans=0;
  trav(a,X){
    lld can=1;
    int A=a.first;
    rep(i,1,MAX){
      int L=(A/(i+1));
      int R=(A/i);
      can+=DP[i]*(min(R,CHATO)-min(L,CHATO));
      can%=MOD;
      
    }
    can%=MOD;
    can+=MOD;
    can%=MOD;
    can*=a.second;
    can%=MOD;
    ans+=can;
  }
  ans%=MOD;
  cout<<ans<<"\n";
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tt = 1;
  DP[0]=0;
  rep(i,0,MAX)pref[i]=0;
  int sum=1;
  rep(i,1,MAX){
    sum+=pref[i];
    sum%=MOD;
    DP[i]=sum;
    for(int j=2;j*i<MAX;j++){
      pref[j*i]+=DP[i];
      red(pref[j*i]);
      pref[j*i+j]-=DP[i];
      red(pref[j*i+j]);
    }
  }

  // cin >> tt;
  while (tt--) solve();
  return 0;
}