#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }
template<typename T, size_t X> ostream& operator<<(ostream& os, const array<T, X>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

ll n;

void read() {
  cin >> n;
}

using RetType = int;

/*
map<ll, ll> memo;

ll dp(ll n0, ll a0) {
  if (memo.count(n0)) reutnr memo[n0];
  ll res = 1;

  // n0 = a * a * x
  // a <= x
  for (ll a = a0; a * a * a <= n0; a += a1min) if (n0 % (a * a) == 0) {
    res += dp(n0 / a, a);
  }
  // a >= x
  for (ll x = 1; )

  return memo[n0] = res;
}
*/

int s;
using A = vector<pair<int, int>>; // curr, sum + target * 1000
int sum0;
map<A, int> memo;
int dfs(A p) {
  ranges::sort(p);
  // dump(p);
  if (memo.count(p)) return memo[p];
  // dump(curr << " " << sum);

  int ss = 0;
  for (int i : range(s)) ss += p[i].second % 1000;
  if (ss == sum0) {
    return 1;
  }

  A next(s);
  auto dfs2 = [&](auto self, int idx, int tot) -> int {
    if (idx == s) {
      if (tot) return dfs(next);
      return 0;
    }
    int curr = p[idx].first;
    int sum = p[idx].second % 1000;
    int target = p[idx].second / 1000;

    int res = 0;
    for (int val : range(curr, 1 + target)) {
      if (val + sum > target) break;
      next[idx].first = val;
      next[idx].second = sum + val + target * 1000;
      res += self(self, idx + 1, tot + val);
    }
    return res;
  };

  int res = dfs2(dfs2, 0, 0);
  return memo[p] = res;
}

RetType run() {
  map<ll, ll> mp;

  for (ll p = 2; p * p * p <= n; ++p) {
    while (n % p == 0) mp[p]++, n/= p;
  }

  if (n > 1) {
    ll x = (ll)(sqrt(n) + 0.5);
    if (x * x == n) mp[x] += 2;
    else mp[n]++;
  }

  /*
  ll res = 0;
  for (int size = 1; size <= 100; ++size) {
    ll t = 1;
    // a[1] + ... + a[size] = e
    // a[i] <= ... <= a[size]

    for (auto p : mp) {
      int e = p.second;

      if (e <= 1) continue;

      vector<vector<ll>> dp(e + 1, vector<ll>(e + 1));
      dp[0][0] = 1;

      for ([[maybe_unused]] ll iter : range(size)) {
        vector<vector<ll>> next(e + 1, vector<ll>(e + 1));
        for (int now : range(e + 1))
        for (int sum : range(e + 1)) {
          for (int val : range(now, e + 1)) {
            if (sum + val > e) break;
            next[val][sum + val] += dp[now][sum];
          }
        }
        dp.swap(next);

        if (size == 2) dump(dp);
      }

      ll tot = 0;
      for (int i : range(e + 1)) tot += dp[i][e];
      t *= tot;
    }

    if (size <= 3) dump(size << " " << t);

    res += t;
  }

  return res;
  */

  s = (int)mp.size();
  vector<int> vm(s);
  int idx = 0;
  for (auto p : mp) vm[idx++] = p.second;

  ranges::sort(vm);
  while (vm.size() > 0 && vm[0] == 1) vm.erase(vm.begin());
  s = (int)vm.size();

  sum0 = accumulate(vm.begin(), vm.end(), 0);

  dump(vm);

  if (s == 0) {
    dump("NONE");
    return 1;
  }

  memo.clear();
  A z(s);
  for (int i : range(s)) z[i].second = vm[i] * 1000;
  int res = dfs(z);

  return res;
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}