#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

const int MAX = 60;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    ll N;
    cin >> N;
    vector<pair<ll, int>> v;
    for (ll i = 2; i * i * i <= N; i++) {
        if (N % i != 0) continue;
        int cnt = 0;
        while (N % i == 0) {
            N /= i;
            cnt++;
        }
        v.emplace_back(i, cnt);
    }

    ll lb = 0, ub = 1e9 + 10;
    while (ub - lb > 1) {
        ll mid = (lb + ub) >> 1;
        (mid * mid <= N ? lb : ub) = mid;
    }
    if (lb > 1 and lb * lb == N) {
        v.emplace_back(lb, 2);
        N = 1;
    }
    vector dp(MAX + 1, vector<ll>(MAX + 1, 0));
    dp[0][0] = 1;
    for (int i = 1; i <= MAX; i++) {
        for (int j = 0; j <= MAX; j++) dp[i][j] += dp[i - 1][j];
        for (int j = 0; j + i <= MAX; j++) dp[i][j + i] += dp[i][j];
    }
    ll ans = 1;
    for (auto [val, cnt] : v) ans *= dp[MAX][cnt];

    cout << ans << "\n";
    return 0;
}