#include <bits/stdc++.h>
using namespace std;
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;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    map<ll,ll> mp;
    vector<ll> d;
    for(ll i=1;i*i<=n;i++){
        if(n%i) continue;
        mp[i]++;
        d.push_back(i);
        if(i*i!=n){
            mp[n/i]++;
            d.push_back(n/i);
        }
    }
    ll dd = 499122177;
    for(auto [p,q]:mp){
        for(auto x:d){
            ll k = x/__gcd(x,p)*p;
            if(mp.count(k)&&p<k){
                mp[k] = (mp[k] + q) % MOD;
            }
        }
    }
    cout << mp[n]*dd%MOD << '\n';
    return 0;
}