#include <bits/extc++.h>
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

// To use most b i ts rather than jus t the lowest ones :
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;

    ll operator()(ll x) const { return __builtin_bswap64(x*C); }
};

__gnu_pbds::gp_hash_table<ll,ll,chash> rdp({},{},{},{},{1<<25});

const ll mod = 998244353;
const ll N = 20210926;
const ll DPC = 31627;

ll TN;
vector<ll> dp(DPC, 0);

void prep(){
    dp[1] = 1;

    for(int i = 2; i < DPC; i++){
        for(int j = 1; j * j <= i; j++){
            if(i % j)
                continue;

            dp[i] += dp[i / j];

            if(j * j != i)
                dp[i] += dp[j];

            dp[i] %= mod;
        }
    }

    for(int i = 1; i < DPC; i++)
        dp[i] = (dp[i] + dp[i - 1]) % mod;
}

ll rec(ll n){
    if(TN / n < DPC)
        return dp[TN / n];

    if(rdp.find(n) != rdp.end())
        return rdp[n];

    ll ans = 1;

    for(ll v = 2; v < DPC; v++){
        if(v * n <= TN)
            ans += rec(v * n);

        ll ub = min(N, TN / (n * (v - 1)));
        ll lb = max(DPC, TN / (n * v) + 1);

        if(ub >= lb)
            ans += (ub - lb + 1) * dp[v - 1];
        
        ans %= mod;
    }

    rdp[n] = ans;
    
    return ans;
}

int main(){
    cin >> TN;

    prep();

	cout << rec(1) << "\n";
}