#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define min(a,b) ((a)>(b)?(b):(a))
const int maxn=1e6+10;
int n;
const int P=998244353;
ll dp[maxn];
int is[maxn],fac[maxn],prime[maxn],cnt,pre[maxn];
void factor() {
    int n=maxn-1;
	is[1]=1;fac[1]=1;
	for(int i=1;i<=n;i++){
		if(!is[i]){prime[++cnt]=i;fac[i]=2;pre[i]=1;}
		for(int j=1;j<=cnt&&i*prime[j]<=n;j++) {
			is[prime[j]*i]=1;
			if(i%prime[j]){
				fac[i*prime[j]]=2*fac[i];
				pre[i*prime[j]]=1;
			} else {
				pre[i*prime[j]]=pre[i]+1;
				fac[i*prime[j]]=fac[i]/(pre[i]+1)*(pre[i]+2);
				break;
			}
		}
	}
}
int main() {
    factor();
    scanf("%d",&n);
    dp[0]=dp[1]=1;
    ll sum=2;
    for(int i=2;i<=n;++i) {
        dp[i]=(dp[i]+sum)%P;
        dp[i]=(dp[i]+(fac[i]-1))%P;
        sum=(dp[i]+sum)%P;
    }
    printf("%lld\n",dp[n]);
}