#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

// если модуль подается на вход, убрать все <> и раскомментировать нужные строки
using uint = unsigned int;
using ull = unsigned long long;
template <uint MD> struct ModInt {
    using M = ModInt;
    // static int MD;
    uint v;
    ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(uint((ull)v * r.v % MD)); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    bool operator!=(const M& r) const { return v != r.v; }
    M inv() const;
    friend istream& operator>>(istream& is, M& r) { ll x; is >> x; r = M(x); return is; }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};

template<uint MD>
ModInt<MD> pow(ModInt<MD> x, ll n) {
    ModInt<MD> r = 1;
    while (n) {
        if (n & 1) r *= x;
        x *= x;
        n >>= 1;
    }
    return r;
}

template<uint MD>
ModInt<MD> ModInt<MD>::inv() const { return pow(*this, MD - 2); }
// or copy egcd and {return egcd(MD, v, 1).second;}

// if MD is from input
// this line is necessary, read later as you wish
// int ModInt::MD;

using Mint = ModInt<998244353>;
// using Mint = double;

const int R = 20210926;
const int M = 50010;

int n;
Mint f1[M];
Mint f2[M];

void solve() {
    cin >> n;
    if (n <= 3) {
        cout << n << "\n";
        return;
    }
    int p = 1;
    while ((p + 1) * (p + 1) <= n) {
        p++;
    }
    f1[1] = 1;
    for (int d = 2; d <= p; d++) {
        int x = (n / d);
        Mint ans = 1;
        int k = 2;
        while (k <= R && k * x <= n) {
            int cur_d = n / (k * x);
            int rk = (n / (cur_d * x));
            rk = min(rk, R);
            ans += f1[cur_d] * (rk - k + 1);
            k = rk + 1;
        }
        f1[d] = ans;
    }
    int rgt = (n / (p + 1));
    for (int x = rgt; x >= 1; x--) {
        Mint ans = 1;
        int k = 2;
        while (k <= R && k * x <= n) {
            if (k * x > rgt) {
                int cur_d = n / (k * x);
                int rk = (n / (cur_d * x));
                rk = min(rk, R);
                ans += f1[cur_d] * (rk - k + 1);
                k = rk + 1;
            } else {
                ans += f2[k * x];
                k++;
            }
        }
        f2[x] = ans;
    }
    cout << f2[1] << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}