#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define fillc(a,b) memset(a,b,sizeof(a))
#define MOD 998244353

void solve()
{
    ll n,i,j;
    cin>>n;
    ll dp[n+1];
    fillc(dp,0);
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j+=i)
            dp[j]++;
    ll sum=0;
    for(i=1;i<=n;i++)
    {
        dp[i]=(dp[i]+sum)%MOD;
        sum=(sum+dp[i])%MOD;
    }
    cout<<dp[n]<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}
