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

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

    long long N; cin >> N;
    long long memoN = 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 >= 2) pf.push_back(e2);
        if(e3 >= 2) pf.push_back(e3);
    }
    {
        long long i=5;
        while(i*i*i <= memoN){
            int e = 0;
            while(N%i == 0) e++,N /= i;
            if(e >= 2) pf.push_back(e);
            e = 0; i += 2;
            while(N%i == 0) e++,N /= i;
            if(e >= 2) pf.push_back(e);
            i += 4;
        }
    }
    long long low = 2,high = 2e9;
    while(high-low > 1){
        long long mid = (high+low)/2;
        if(mid*mid >= N) high = mid;
        else low = mid;
    }
    if(high*high == N) pf.push_back(2);

    int answer = 0,n = pf.size();
    vector<int> multi(n+1,1);
    for(int i=1; i<=n; i++){
        int now = pf.at(i-1)+1;
        multi.at(i) = multi.at(i-1)*now;
    }
    swap(pf,multi); //まちがえた.

    //unordered_map<long long,long long> M;
    auto dfs = [&](auto dfs,int left,int need) -> long long {
        //long long &ret = M[1001001001LL*left+need];
        //if(ret){answer += ret; return ret;}
		int ret = 0;

        for(int i=0; i<n; i++){
            int le = left%pf.at(i+1)/pf.at(i),ne = need%pf.at(i+1)/pf.at(i);
            if(ne > le) return 0;
            left -= ne*pf.at(i);
        }
        answer++; ret++;

        int next = left;
        if(need) ret += dfs(dfs,left,need);

        while(true){
            int pos = 0;
            while(pos != n){
                int now = next%pf.at(pos+1)/pf.at(pos);
                if(now == 0){
                    next += left%pf.at(pos+1)/pf.at(pos)*pf.at(pos);
                    need -= left%pf.at(pos+1)/pf.at(pos)*pf.at(pos);
                    pos++;
                }
                else{next -= pf.at(pos),need += pf.at(pos); break;}
            }
            if(pos == n) break;
            ret += dfs(dfs,next,need);
        }
        return ret;
    };
    dfs(dfs,pf.at(n)-1,0);
    cout << answer << endl;
}