#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { 1, 0, -1, 0};
const int dy[4] = { 0, -1, 0, 1};
const int inf = 1e9 + 1;
const ll infll = 1e18;
//const double pi = acos(-1);
     
using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;

const int SIZE = 400010;
ll powll(ll n, ll x) {
    // return n ^ x;
    ll ret = 1;
    rep(i, x) ret *= n;
    return ret;
}
void OutputYesNo(bool val) {
    if (val) cout << "Yes" << endl;
    else cout << "No" << endl;
}
void OutputTakahashiAoki(bool val) {
    if (val) cout << "Takahashi" << endl;
    else cout << "Aoki" << endl;
}
void OutPutInteger(ll x) { cout << x << endl; }
void OutPutString(string x) { cout << x << endl; }

int pop_count(ll n){
    int ret = 0;
    while(n > 0){
        if(n % 2 == 1) ret++;
        n /= 2; 
    }
    return ret; 
}

//using PAIR_REV_PQ = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;
//typedef modint mint;
//typedef vector<mint> ModintVec;
//typedef vector<ModintVec> ModintMat; 

vector<ll> div(ll m){
    vector<ll> ret;
    for(ll i = 1; i * i <= m; i++){
        if(m % i == 0){
            ret.push_back(i);
            if(i * i != m) ret.push_back(m / i);
        }
    }

    return ret;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n; cin >> n;
    vector<ll> d = div(n);
    sort(all(d));
    d.erase(d.begin());

    map<ll, ll> dp1, dp2;
    dp1[1] = 1;
    ll mod = 998244353;
    ll res = 0;

    ll INF = 2e12;
    rep(i, 45){
        for(auto y : dp1){
            for(ll x : d){
                if(y.first > INF / x) break;
                ll l = lcm(x, y.first);
                if(l > y.first){
                    dp2[l] += dp1[y.first] * y.second;
                    if(dp2[l] >= mod){
                        dp2[l] %= mod;
                    }
                }
            }
        }

        if(dp2.empty()) break;
        res += dp2[n];
        res %= mod;
        dp1 = dp2;
        dp2.clear();
    }
    cout << res << endl;
}