#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll int
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 998244353
set<ll> s;
ll n,lsh[100010],cnt=0;
long long f[100010];
struct hash{
	#define MOD 10007
	ll head[10007],nxt[100010],to[100010],cnt=0;
	il void ins(ll x){
		nxt[++cnt]=head[x%MOD];
		to[cnt]=x;
		head[x%MOD]=cnt;
	}
	il bl query(ll x){
		for(ll i=head[x%MOD];i;i=nxt[i]) if(to[i]==x) return 1;
		return 0;
	}
}H;
int main(){
	n=read();
	H.ins(n+1);
	s.insert(n+1);
	fr(i,1,1){
		H.ins(i);
		s.insert(i);
	}
	while(!s.empty()){
		ll x=*(--s.end());
		s.erase(x);
		lsh[++cnt]=x;
		if(x<=1) continue;
		ll l=2,r;
		while(l<=min(x-1,20210926)){
			r=(x-1)/((x-1)/l);
			ll tmp=(x-1)/l+1;
			if(tmp<=1) break;
			if(!H.query(tmp)){
				H.ins(tmp);
				s.insert(tmp);
			}
			l=r+1;
		}
	}
	reverse(lsh+1,lsh+cnt+1);
	pfr(i,cnt-1,1){
		f[i]=1;
		ll l=2,r,lst=1;
		while(l<=20210926&&l*lsh[i]<=n){
			ll pos=upper_bound(lsh+lst,lsh+cnt+1,lsh[i]*l)-lsh-1;
			r=min(20210926,(lsh[pos+1]+lsh[i]-1)/lsh[i]-1);
			f[i]+=(r-l+1)*f[pos];
			l=r+1;
			lst=pos;
		}
	}
	write(f[1]%mod);
}