#include<bits/stdc++.h>
using u64 = unsigned long long;
using std::cin;
using std::cout;
const int mod = 998244353;
const int lim = 1e7;
std::unordered_map<u64, int> map;
void add(int & x, int y) {
	if((x += y) >= mod) {
		x -= mod;
	}
}
int mem[lim];
int dfs(int n) {
	if(n < lim) {
		if(mem[n] >= 0) return mem[n];
	} else {
		if(map.count(n)) return map[n];
	}
	int & ans = (n < lim ? mem[n] : map[n]) = 1;
	int l = 2;
	const int M = std::min(n, 20210926);
	for(;l <= M;) {
		int v = n / l;
		int r = std::min(n / v, M);
		ans = (ans + dfs(n / l) * u64(r - l + 1)) % mod;
		l = r + 1;
	}
	return ans;
}
int main() {
	memset(mem, -1, sizeof(mem));
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
//	freopen("$.in", "r", stdin);
#endif
	int n;
	cin >> n;
	cout << dfs(n) << '\n';
}