#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 998244353
const int N=1000006;
ll f[N]={0,1};
ll s[N]={0,1};
ll cnt[N]={0};
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j+=i){
			cnt[j]++;
		}
	}

	for(int i=2;i<=n;i++){
		f[i]=(s[i-1]%mod+cnt[i]%mod)%mod;
		s[i]=(s[i-1]%mod+f[i]%mod)%mod;
	}

	cout<<f[n]<<endl;
	return 0;
}
