#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MOD = 998244353;

int add(int a, int b) {
	return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
	return a >= b ? a - b :  a + MOD - b;
}

int mul(int a, int b) {
	return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
	int res = 1;
	while (n) {
		if (n % 2 == 0) {
			x = mul(x, x);
			n /= 2;
		} else {
			res = mul(res, x);
			--n;
		}
	}
	return res;
}

const int K = 20210926;
const int MAXN = 200000;

int vals[MAXN];
int pref_sums[MAXN];
unordered_map<int, int> mem;

int get_ans(int n) {
	if (n < MAXN)
		return pref_sums[n];
        if (mem.count(n)) return mem[n];
	int ans = 1;
	int left = 2;
	while (left <= n && left <= K) {
		int right = min(K + 1, (n / (n / left)) + 1);
		ans = add(ans, mul(get_ans(n / left), (right - left) % MOD));
		left = right;
	}
	return mem[n] = ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	vals[1] = 1;
	for (int i = 1; i < MAXN; ++i) {
		pref_sums[i] = add(pref_sums[i - 1], vals[i]);
		for (int j = 2 * i; j < MAXN; j += i)
			vals[j] = add(vals[j], vals[i]);
	}

	int n;
	cin >> n;
	cout << get_ans(n) << '\n';
	return 0;
}