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

using namespace std;

typedef long long ll;

#define depref(x, y) (x[y] - x[y-1])

// 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);

ll solve(){
    dp[0] = 0;
    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 ans = dp[min(TN, DPC - 1)];
	ll tans = 0;

    for(ll i = 1; i < DPC; i++){
		tans = 0;
		
        for(ll v = (DPC + i - 1) / i; v * i <= TN && v < DPC;){
            ll dpi = TN / (i * v);
            ll ub = min(DPC, (TN / dpi) / i + 1);

            //cout << dpi << " " << TN / (i * (ub - 1)) << " " << v << " " << ub << "\n";

            //assert(dpi == TN / (i * (ub - 1)) && dpi != TN / (i * ub));

            tans += (ub - v) * dp[dpi] % mod;

            v = ub;
        }
		
		tans = tans * depref(dp, i) % mod;
		
		ans = (ans + tans) % mod;

        for(ll v = 2; v < DPC; v++){
            if(TN / (i * (v - 1)) < DPC)
                break;

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

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

            ans %= mod;
        }
    }

    return ans;
}

int main(){
    cin >> TN;

    cout << solve() << "\n";
}