#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [";
    while (L != R) cerr << " " << *L++;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int mod = 998244353;
int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}
int mul(int64_t a, int64_t b) {
    return static_cast<int>(a * b % mod);
}

const int L = 2, R = 20210926;
int g(int n) {
    static unordered_map<int,int> mp;
    if (n <= 0)
        return 0;
    if (auto it = mp.find(n); it != mp.end()) {
        return it->second;
    }

    int ans = 1;
    for (int i = 1, j, s; i <= n; i = j) {
        s = n / i;
        j = n / s + 1;
        // [i, j)
        int l = max(L, i);
        int r = min(R+1, j);
        if (l < r) {
            ans = add(ans, mul(r - l, g(s)));
        }
    }
    return mp[n] = ans;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    cout << g(n) << '\n';

    return 0;
}