#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int maxn = 1e6 + 10;
const int mod = 998244353;

int n;
ll f[maxn];

int main() {
    f[0] = 1;
    for (int i = 1; i < maxn; i++) {
        for (int j = i; j < maxn; j += i) {
            f[j]++;
        }
    }
    ll pre = 1;
    for (int i = 1; i < maxn; i++) {
        f[i] = (f[i] + pre - 1 + mod) % mod;
        pre = (pre + f[i]) % mod;
    }
    cin >> n;
    cout << f[n];
}