#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
using mint = modint998244353;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n;
    mint q;
    cin >> n;
    unordered_map<ll,mint> mp;
    vector<ll> d;
    for(ll i=1;i*i<=n;i++){
        if(n%i) continue;
        d.push_back(i);
        if(i*i!=n){
            d.push_back(n/i);
        }
    }
    mp[1] = 1;
    sort(all(d));
    for(auto& x:d){
        q = mp[x];
        for(auto& y:d){
            if(!(x%y)) continue;
            ll k = x/__gcd(x,y)*y;
            if(!(n%k)){
                mint& m = mp[k];
                m += q;
            }
        }
    }
    cout << mp[n].val() << '\n';
    return 0;
}