#include <bits/stdc++.h>
#define mod 998244353
#define ll long long
using namespace std;
ll ff[20230000];
ll fk(ll x)
{
    ll f(ll x);
    ll ans=0;
    ll tmp=min(x,20210926ll);
    for(int l=1,r=0;l<=tmp;l=r+1)
    {
        r = tmp / (tmp / l);
        if(l==1) continue;
        ans=(ans+(r-l+1)*f(x/l)%mod)%mod;
    }
    return ans;
}
ll f(ll x)
{
    if(x<20230000 and ff[x]) return ff[x];
    if(x==0)
    {
        return 0;
    }
    else if(x==1)
    {
        return 1;
    }
    else
    {
        if(x>=20230000)return (fk(x)+1)%mod;
        else return ff[x]=(fk(x)+1)%mod;
    }
}
int main() {
    ll n;
    cin>>n;
    cout<<f(n);
    return 0;
}