#include<iostream>
#include<cstdio>
#include<map>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<ctime>
using namespace std;
#define M 100005
#define N 1000005
#define MP make_pair
#define debug() cerr<<"Why So Serious?"<<endl
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
template<class T>void Rd(T &x){
	x=0;static char c;
	while(c=getchar(),c<48);
	do x=(x<<1)+(x<<3)+(c^48);
	while(c=getchar(),c>47);
}
const int md=998244353;
int dp[1000005];
int main(){
	int n;
	cin>>n;
	int sum=0;
	for(int i=1;i<=n;++i){
		for(int j=i;j<=n;j+=i)
			(dp[j]+=1)%=md;
		(dp[i]+=sum)%=md;
		(sum+=dp[i])%=md;
	}
	printf("%d\n",dp[n]);
	return 0;
}
