#include <bits/stdc++.h>
using namespace std;
long long int A;
int pr[1040005];
vector<int> primes;
int nrp;
bool check(long long int x) {
  for (int i = (0); i < (nrp); ++i) {
    if (x % primes[i] == 0) return false;
    if (primes[i] * 1LL * primes[i] > x) return true;
  }
  return true;
}
vector<long long int> kutas[1040000];
vector<int> gp;
vector<long long int> diw;
int memo[10000][2500];
map<long long int, int> wdruga;
int rob(int l, int k) {
  long long int x = diw[l];
  if (x == 1) {
    memo[l][k] = 1;
    return 1;
  }
  if (k == gp.size()) {
    if (x - 1 > primes[gp.back()]) {
      if (check(x - 1)) {
        memo[l][k] = 1;
        return 1;
      }
    }
    memo[l][k] = 0;
    return 0;
  }
  if (x < primes[gp[k]]) return 0;
  int ans = memo[l][k + 1];
  int myp = gp[k];
  for (int j = (0); j < (kutas[myp].size()); ++j) {
    if (x % kutas[myp][j] == 0) {
      ans += memo[wdruga[x / kutas[myp][j]]][k + 1];
    }
    if (kutas[myp][j] > x) break;
  }
  memo[l][k] = ans;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> A;
  if (A == 1) {
    cout << 1 << endl;
    return 0;
  }
  if (A == 2) {
    cout << 0 << endl;
    return 0;
  }
  for (int i = (0); i < (1e6 + 2); ++i) pr[i] = 0;
  for (int i = 2; i <= 1e6; i++) {
    if (pr[i] == 0) {
      primes.push_back(i);
      for (long long int j = i * 1LL * i; j <= 1e6; j += i) pr[j] = 1;
    }
  }
  for (long long int i = 1; i * i <= A; i++) {
    if (A % i == 0) {
      diw.push_back(i);
      if (i != A / i) diw.push_back(A / i);
    }
  }
  set<int> dupa;
  for (int i = (0); i < (primes.size()); ++i) {
    long long int pot = primes[i];
    int act = 1;
    while (pot <= A) {
      if (A % (pot + 1) == 0) {
        kutas[i].push_back(pot + 1);
        dupa.insert(i);
      }
      pot *= primes[i];
      act++;
    }
  }
  for (__typeof((dupa).begin()) i = ((dupa).begin()); i != (dupa).end(); ++i)
    gp.push_back(*i);
  if (gp.size() == 0) {
    cout << 0 << endl;
    return 0;
  }
  nrp = primes.size();
  sort((diw).begin(), (diw).end());
  for (int j = (0); j < (diw.size()); ++j) wdruga[diw[j]] = j;
  for (int i = (0); i < (diw.size()); ++i)
    for (int j = (gp.size()); j >= (0); --j) {
      rob(i, j);
    }
  cout << memo[diw.size() - 1][0] << endl;
}
