#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=3000010,MOD=998244353;
const char en='\n';
const ll LLINF=1ll<<60;

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

inline int add(int A, int B) {
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0) return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B) {
	return (long long)A * B % MOD;
}

int n,getInd[N];
vi vals;
vi dp;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	for (int i=1;i*i<=n;++i) vals.pb(i),vals.pb(n/i);
	sort(all(vals));
	vals.erase(unique(all(vals)),vals.end());
	unordered_map<int,int> um;
	for (int i=0;i<(int)vals.size();++i) if (vals[i]<N) getInd[vals[i]]=i;
	else um[vals[i]]=i;
	for (int i=0;i<(int)vals.size();++i)
	{
		int cu=vals[i],an=1,lo=1,hi=1;
		if (cu>1) for (int j=1;j*j<=cu;++j)
		{
			//floor(cu/x)=j
			lo=cu/(j+1)+1,hi=cu/j;
			hi=min(hi,20210926);
			lo=max(lo,2);
			if (lo>hi) continue;
			//cout<<cu<<' '<<lo<<' '<<hi<<' '<<j<<endl;
			ad(an,mul(hi-lo+1,dp[getInd[j]]));
		}
		for (int j=2;j<lo;++j)
		{
			int uz=cu/j,in;
			if (uz<N) in=getInd[uz];
			else in=um[uz];
			//cout<<uz<<' '<<in<<' '<<dp[in]<<en;
			ad(an,dp[in]);
		}
		//cout<<cu<<' '<<an<<en;
		dp.pb(an);
	}
	cout<<dp.back()<<en;
}