#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

map<ll, ll> prime;

void prime_factor(ll n){
    ll m = n;

    if (n % 2 == 0){
        while(n % 2 == 0){
            prime[2]++;
            n /= 2;
        }
    }

    for (ll i = 3; i*i <= m; i+=2){
        if (n % i == 0){
            while(n % i == 0){
                prime[i]++;
                n /= i;
            }
        }
    }

    if (n != 1){
        prime[n]++;
    }
}

vector<ll> factor;

void all_factor(ll n){
    for (ll i = 1; i*i <= n; i++){
        if (n % i == 0){
            factor.push_back(i);
            if (i*i != n) factor.push_back(n / i);
        }
    }
    sort(factor.begin(), factor.end());
}

const ll modc = 998244353;

int main(){

    ll N, M, x, y;
    cin >> N;
    prime_factor(N);
    all_factor(N);
    M = factor.size();
    vector<ll> dp(M);
    dp[0] = 1;
    vector<vector<ll>> c(M); 

    for (int i=0; i<M; i++){
        y = factor[i];
        for (auto [p, e] : prime){
            x = 0;
            while(y % p == 0){
                y /= p;
                x++;
            }
            c[i].push_back(x);
        }
    }

    for (int i=0; i<M; i++){
        for (int j=0; j<i; j++){
            if (factor[i] % factor[j] != 0) continue;
            x = 1;
            for (int k=0; k<prime.size(); k++){
                if (c[i][k] == c[j][k]) x = x * (c[i][k]+1) % modc;
            }
            dp[i] += (dp[j] * x) % modc;
            dp[i] %= modc;
        }
    }

    cout << dp[M-1] << endl;

    return 0;
}