#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mo = 998244353;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    map<int,int> mp;
    auto calc = [&](auto self,int x) -> int {
        if(x == 0)return 0;
        if(mp.find(x) != mp.end()) return mp[x];
        int l = 2,r;
        ll ans = 1;
        while(l <= 20210926){
            ll t = x / l;
            if(t) r = min(x / (x / l),20210926);
            else r = 20210926;
            ans += 1ll * (r - l + 1) * self(self,x / l) % mo;
            ans %= mo;
            l = r + 1;
        }
        return mp[x] = ans;
    };
    if(n > 1) {
        cout << calc(calc,n) << endl;

    }else {
        ll ans = 0;
        int cnt = 1;
        vector<int> f(n + 1,1);
        for(int i = n - 1;i >= 1;i --) {
            for(int j = 2 * i;j <= n;j += i) {
                f[i] += f[j];
                // cerr << f[j] << " ";
            }//cerr << endl;
        }
        cout << f[1] << endl;
    }
}


// n / 20210926 <= k


/// 1 2 3 4 5 6 7 8

// 14 5 2 2 1 1 1 1

// 13 4 1 1 0 0 0 0

// 12 3 0 0 0 0 0 0

//