#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int,int> PII;
const int N = 1e6+10,mod = 998244353,INF=1e12,cap  = 20210926;
int dp[N];
map<int,int>mp;
void init()
{
    dp[1]=1;
    for(int i=1;i<N;i++)
    {
        dp[i]%=mod;
        for(int j=i*2;j<N;j+=i) dp[j]+=dp[i];
    }
    for(int i=2;i<=N;i++)
    {
        dp[i]+=dp[i-1];
        if(dp[i]>=mod)  dp[i]-=mod;
    }

}
int solve(int n)
{
    if(n<N) return dp[n];
    if(mp.count(n)) return mp[n];
    int ans=1;
    for(int l=2,r;l<=min(cap,n);l=r+1)
    {
        r = n/(n/l);
        ans =(ans + solve(n/l)*(min(cap,r)-l+1))%mod;
    }
    return mp[n]=ans;
}

signed main()
{
    int T=1;
    cin.tie(0)->sync_with_stdio(false);
    //cin>>T;
    init();
    while(T--)
    {
        int n;
        cin>>n;
        cout<<solve(n)<<"\n";
    }

    return 0;
}