#include <bits/stdc++.h>

using namespace std;

const int INF = 998244353;

int n;
int f[100005];
vector<int> vec;

int main(){
	scanf("%d", &n);
	for(int i = 1, j, k; i <= n; i = j + 1){
		k = n / i, j = n / k;
		vec.push_back(i);
	}
	for(int i = vec.size() - 1; i >= 0; --i){
		f[i] = 1;
		for(int j = 2; j <= 20210926 && vec[i] * j <= n; ){
			int pos = upper_bound(vec.begin(), vec.end(), vec[i] * j) - vec.begin() - 1;
			int l = vec[pos];
			int r;
			if(pos == vec.size() - 1) r = n;
			else r = vec[pos + 1] - 1;
			
			int k = min(20210926, r / vec[i]);
			
			// printf("i = %d (%d %d) j = %d k = %d\n", vec[i], l, r, j, k);
			
			f[i] = (f[i] + 1ll * (k - j + 1) * f[pos]) % INF;
			j = k + 1;
		}
	}
	
	printf("%d\n", f[0]);
	return 0;
}