#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod = 998244353;
const int N = 20210926;
const int SB = 32;

vector<vector<ll>> stirl(SB + 1, vector<ll>(SB + 1, 0));
vector<ll> bell(SB+1, 0), pref(N+1);
vector<int> lp(N+1), pr;

void prep(){
    for (int i=2; i <= N; ++i) {
        if (lp[i] == 0) {
            lp[i] = i;
            pr.push_back(i);
        }
        for (int j = 0; i * pr[j] <= N; ++j) {
            lp[i * pr[j]] = pr[j];
            if (pr[j] == lp[i]) {
                break;
            }
        }
    }
    
    for(int i = 1; i <= SB; i++){
        stirl[i][i] = 1;
        stirl[i][1] = 1;
    }

    for(int n = 2; n <= SB; n++){
        for(int k = 2; k <= n; k++){
            stirl[n][k] = (stirl[n-1][k-1] + k * stirl[n-1][k]) % mod;
        }
    }

    for(int n = 1; n <= SB; n++){
        for(int k = 1; k <= n; k++){
            bell[n] += stirl[n][k];
        }

        bell[n] %= mod;
    }

    pref[0] = 0;
    pref[1] = 1;

    for(int i = 2; i <= N; ++i){
        pref[i] = pref[i-1];

        int ti = i;
        int cnt = 0;

        while(ti != 1){
            cnt++;
            ti /= lp[ti];
        }

        pref[i] += bell[cnt];
        pref[i] %= mod;
    }
}

int main(){
    prep();

    int n;
    cin >> n;

    ll ans = 0;

    for(int i = 1; i <= n; i++){
        ans += pref[i] - pref[i-1];
    }

    cout << ans << "\n";
}