#include<cstdio>
#include<iostream>
#include<cassert>
#include<unordered_map>
#define RI register int
#define CI const int&
using namespace std;
const int mod=998244353;
int n; unordered_map <int,int> g;
inline int G(CI n)
{
    if (g.count(n)) return g[n]; int ret=1;
    for (RI l=2,r;l<=n&&l<=20210926;l=r+1)
    {
        r=min(20210926,n/(n/l));
        (ret+=1LL*(r-l+1)*G(n/l)%mod)%=mod;
    }
    return g[n]=ret;
}
int main()
{
    scanf("%d",&n);
    /*for (int n=1;n<=1000;++n)
    {
        static int f[1005],g[1005];
        for (RI x=1000;x>=1;--x)
        {
            f[x]=1;
            for (RI k=2;k<=20210926;++k)
            {
                long long y=x*k;
                if (y>n) break;
                (f[x]+=f[y])%=mod;
            }
        }
        for (RI x=1;x<=1000;++x)
        {
            g[x]=1;
            for (RI k=2;k<=20210926;++k)
            {
                int y=x/k;
                if (y==0) break;
                (g[x]+=g[y])%=mod;
            }
        }
        assert(f[1]==g[n]);
        //printf("%d %d\n",f[1],g[n]);
    }*/
    return printf("%d",G(n)),0;
}