#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; --i)

using mint = modint998244353;
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<ll> f;
    for (ll d = 1; d * d <= n; d++) {
        if (n % d == 0) {
            f.push_back(d);
            if (d * d < n) {
                f.push_back(n / d);
            }
        }
    }
    sort(f.begin(), f.end());

    int m = f.size();

    unordered_map<ll, int> index;
    rep(i, m) index[f[i]] = i;

    vector<mint> dp(m);
    dp[0] = 1;
    rep(i, m) {
        rep(j, m) {
            ll l = lcm(f[i], f[j]);
            if (l > f[i]) dp[index[l]] += dp[i];
        }
    }
    cout << dp[m - 1].val() << endl;
    return 0;
}