#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
struct fast_ios {
  fast_ios() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
  };
} fast_ios_;
 
template <typename A, typename B> bool chkmin(A &a, const B &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
 
template <typename A, typename B> bool chkmax(A &a, const B &b) {
  if (b > a) {
    a = b;
    return true;
  }
  return false;
}
 
template <typename T> std::istream &operator>>(std::istream &stream, std::vector<T> &vec) {
  for (auto &x : vec)
    stream >> x;
  return stream;
}
 
void scan() {}
 
template <class T, class... Args> void scan(T &a, Args &... rest) {
  std::cin >> a;
  scan(rest...);
}
 
using ll = long long;
using vl = std::vector<ll>;
using vb = std::vector<bool>;
using vi = std::vector<int>;
using pii = std::pair<int, int>;
template <typename T> using vv = std::vector<std::vector<T>>;
#define rng(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define TOKENPASTE(x, y) x##y
#define TOKENPASTE2(x, y) TOKENPASTE(x, y)
#define rep(n)                                                                 \
  for (int TOKENPASTE2(_iter_, __LINE__) = 0,                                  \
                               TOKENPASTE2(_num_, __LINE__) = (int)(n);        \
       TOKENPASTE2(_iter_, __LINE__) < TOKENPASTE2(_num_, __LINE__);           \
       ++TOKENPASTE2(_iter_, __LINE__))
#define FOR(x, cont) for (const auto &x : cont)
#define For(x, cont) for (auto &x : cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))
 
template <typename T>
std::ostream &operator<<(std::ostream &stream, const std::vector<T> &vec) {
  if (!vec.empty()) {
    stream << vec[0];
    for (size_t i = 1; i != vec.size(); ++i)
      stream << ' ' << vec[i];
  }
  return stream;
}
 
template <typename T> void print(const std::vector<T> &t) { std::cout << t << '\n'; }
 
template <typename T> void print(const std::vector<std::vector<T>> &t) {
  for (const auto &row : t) {
    print(row);
  }
}
 
template <typename T> void print(const T &t) { std::cout << t << ' '; }
 
template <typename T, typename... Args>
void print(const T &t, const Args &... rest) {
  print(t);
  print(rest...);
}
 
template <typename T> void println(const T &t) { std::cout << t << '\n'; }
 
template <typename T, typename... Args>
void println(const T &t, const Args &... rest) {
  print(t);
  println(rest...);
}
using namespace std;
 
class FDivisionOrSubstraction {
  static void SOLVE() {
    ll ans = 0;
    ll n; scan(n);
    // n = (ck + 1) * k^e
    // c == 0
    ll m = n;
    int g = -1;
    for (ll i = 2; i * i <= n; ++i) {
      int cnt = 0;
      while (m % i == 0) {
        m /= i;
        ++cnt;
      }
      if (cnt > 0) {
        if (g == -1) g = cnt;
        else g = __gcd(g, cnt);
        if (g == 1) break;
      }
    }
 
    if (g == -1) g = 1;
    else if (g > 1 && m > 1) g = 1;
 
    for (int i = 1; i <= g; ++i) {
      if (g % i == 0) ++ans;
    }
 
    // c > 0
    auto fact = [](ll n) {
      vl f;
      for (ll i = 1; ;++i) {
        ll t = i * i;
        if (t == n) {
          f.pb(i);
          break;
        } else if (t > n) {
          break;
        }
        if (n % i == 0) {
          f.pb(i);
          f.pb(n / i);
        }
      }
      return f;
    };
    auto f = fact(n);
    FOR (x, f) {
      ll j = n / x;
      if (x >= 3) {
        ll y = x - 1;
        auto t = fact(y);
        FOR (k, t) {
          if (k >= 2) {
            ll p = 1;
            while (true) {
              if (p == j) {
                ++ans;
                break;
              }
              if (p > j) break;
              p *= k;
            }
          }
        }
      }
    }
    println(ans);
  }
 
public:
  static void solve(std::istream &in, std::ostream &out) {
    auto cin_buff = std::cin.rdbuf(in.rdbuf());
    auto cerr_buff = std::cerr.rdbuf(cout.rdbuf(out.rdbuf()));
    SOLVE();
    std::cout.rdbuf(cerr.rdbuf(cerr_buff));
    std::cin.rdbuf(cin_buff);
  }
};
 
 
int main() {
  FDivisionOrSubstraction solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}

Measured memory_bytes: 384