#include <atcoder/modint>
#include <bits/stdc++.h>

using namespace std;

using namespace atcoder;
using mint = modint998244353;

int solve(vector<long long> &a) {
    int n = a.size();
    long long int noOfOperations = 0;
    // dp[i] is the number of black subsets of the first i elements such that
    // the i-th element is necessarily painted black.
    vector<mint> dp(n), offload(n);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = i + a[i]; j < n; j += a[i]) {
            noOfOperations++;
            dp[j] += dp[i] + offload[i];
            if (a[j] == a[i]) {
                offload[j] += offload[i] + dp[i];
                break;
            }
        }
    }

    mint ans = 0;
    for (int i = 0; i < n; i++) {
        ans += dp[i];
    }
    cout<<"No Of Operations: "<<noOfOperations<<endl;
    return ans.val();
}

int main() {
    const int n=200000;
    vector<long long> a(n,1);
    int R=447;
    for(int i=0,nxt=R;i<n;i++){
        if(i==nxt){
            R-=1;
            if(R==0)
                break;
            nxt=i+R;
        }
        a[i]=R;
    }
    cout << solve(a) << endl;
    return 0;
}