#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll floor_sqrt(ll X) {
    // 平方根の整数切り捨て。
    ll left = 0;
    ll right = 3000000003;
    while (true) {
        if (right - left <= 1) {
            break;
        }
        ll center = (left + right) / 2;
        if (center * center > X) {
            right = center;
        } else {
            left = center;
        }
    }
    return left;
}

int main() {
    ll N;
    cin >> N;

    // 分割数を求める
    vector<vector<ll>> dp(61, vector<ll>(61));
    dp[0][0] = 1;
    for (ll i = 1; i <= 60; i++) {
        for (ll j = 0; j <= 60; j++) {
            for (ll k = j; k <= 60; k += i) {
                dp[i][k] += dp[i - 1][j];
            }
        }
    }
    vector<ll> part(61, 0);
    for (ll i = 1; i <= 60; i++) {
        part[i] = dp[60][i];
    }

    // debug(part);

    // 素因数分解をする
    map<ll, ll> mp;

    ll N_cpy = N;

    for (ll i = 2; i * i * i <= N; i++) {
        while (N_cpy % i == 0) {
            N_cpy /= i;
            mp[i]++;
        }
    }
    ll ans = 1;
    for (auto it = mp.begin(); it != mp.end(); it++) {
        ans *= part[(it->second)];
    }
    debug(N_cpy);
    ll flsq = floor_sqrt(N_cpy);
    if (flsq * flsq == N_cpy && N_cpy != 1) {
        ans *= part[2];
    }
    cout << ans << endl;
}