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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N; cin >> N;
    vector<int> pf;
    {
        int e2 = 0,e3 = 0;
        while(N%2 == 0) e2++,N /= 2;
        while(N%3 == 0) e3++,N /= 3;
        if(e2) pf.push_back(e2);
        if(e3) pf.push_back(e3);
    }
    {
        long long i=5;
        while(i*i <= N){
            int e = 0;
            while(N%i == 0) e++,N /= i;
            if(e) pf.push_back(e);
            e = 0; i += 2;
            while(N%i == 0) e++,N /= i;
            if(e) pf.push_back(e);
            i += 4;
        }
        if(N != 1) pf.push_back(1);
    }

    int answer = 0,n = pf.size();
    map<pair<vector<int>,vector<int>>,long long> M;
    auto dfs = [&](auto dfs,vector<int> pf,vector<int> need,bool first = false) -> long long {
        long long &ret = M[{pf,need}];
        if(ret){answer += ret; return ret;}

        bool allzero = true;
        for(int i=0; i<n; i++){
            if(need.at(i) > pf.at(i)) return 0;
            pf.at(i) -= need.at(i);
            if(pf.at(i)) allzero = false;
        }
        ret++; answer++;
        if(allzero) return ret;

        vector<int> next = need;
        vector<int> memo = pf;
        if(first == false) ret += dfs(dfs,pf,need);

        while(true){
            int pos = 0;
            while(pos != n){
                pf.at(pos)--; need.at(pos)++;
                if(pf.at(pos) >= 0) break;
                need.at(pos) -= memo.at(pos)+1;
                pf.at(pos) = memo.at(pos);
                pos++;
            }
            if(pos == n) break;
            ret += dfs(dfs,pf,need);
        }
        return ret;
    };
    vector<int> need(pf.size());
    dfs(dfs,pf,need,true);
    cout << answer << endl;
}