#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

int dp[1001001];

void mpl(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long N;
    cin >> N;
    vector<long long>tmp;
    for(int i = 1; 1ll*i*i <= N; i++) {
        if(N%i == 0) {
            tmp.push_back(i);
            if(1ll*i*i != N) tmp.push_back(N/i);
        }
    }
    sort(tmp.begin(),tmp.end());
    vector<long long>p;
    for(int i = 2; 1ll*i*i <= N; i++) {
        if(N%i == 0) p.push_back(i);
        while(N%i == 0) N /= i;   
    }
    if(N > 1) p.push_back(N);
    dp[0] = 1;
    for(int i = 0; i < tmp.size(); i++) {
        for(int j = i+1; j < tmp.size(); j++) {
            if(tmp[j]%tmp[i] == 0) {
                int res = 1;
                long long x = tmp[i],y = tmp[j];
                for(int k = 0; k < p.size(); k++) {
                    int c1 = 0,c2 = 0;
                    while(x%p[k] == 0) x /= p[k],c1++;
                    while(y%p[k] == 0) y /= p[k],c2++;
                    if(c1 == c2) {
                        res = 1ll*res*(c1+1)%mod;
                    }
                }
                mpl(dp[j],1ll*dp[i]*res%mod);
            }
        }
    }
    cout << dp[tmp.size()-1] << "\n";
}