#include <bits/stdc++.h>
using namespace std;
vector<long long> prs, divs;
unordered_map<long long, long long> mm;
void getPrs(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    while (x % i == 0) {
      prs.push_back(i);
      x /= i;
    }
  }
  if (x != 1) {
    prs.push_back(x);
  }
}
void getDivs(long long x, long long ind) {
  if (ind == prs.size()) {
    divs.push_back(x);
    return;
  }
  long long s = ind, f = ind;
  for (; f < prs.size() && prs[s] == prs[f]; f++) {
  }
  long long st = 1;
  for (long long cc = ind; cc <= f; cc++) {
    getDivs(st * x, f);
    st *= prs[s];
  }
}
long long lastBase = -1;
long long cntPr(long long x) {
  lastBase = -1;
  if (x == 0) {
    return 42;
  }
  long long ret = 0;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      lastBase = i;
      while (x % i == 0) {
        x /= i;
      }
      ret++;
    }
  }
  if (x != 1) {
    ret++;
    lastBase = x;
  }
  return ret;
}
vector<long long> posD, cop;
int mem[10042][2042];
long long getCnt(long long A, long long d) {
  if (A == 1) {
    return 1;
  }
  if (d == posD.size()) {
    return 0;
  }
  int aInd = mm[A];
  if (mem[aInd][d]) {
    return mem[aInd][d] - 1;
  }
  long long ret = getCnt(A, d + 1);
  long long c = posD[d];
  for (; c + 1 <= A; c *= posD[d]) {
    if (A % (c + 1) == 0) {
      ret += getCnt(A / (c + 1), d + 1);
    }
  }
  mem[aInd][d] = ret + 1;
  return ret;
}
int solve(long long A) {
  prs.clear();
  posD.clear();
  cop.clear();
  divs.clear();
  getPrs(A);
  sort(prs.begin(), prs.end());
  getDivs(1, 0);
  for (int i = 0; i < divs.size(); i++) {
    mm[divs[i]] = i;
  }
  for (long long i = 0; i < divs.size(); i++) {
    if (cntPr(divs[i] - 1) == 1) {
      posD.push_back(lastBase);
    }
  }
  sort(posD.begin(), posD.end());
  for (long long i = 0; i < posD.size();) {
    long long j = i;
    for (; j < posD.size() && posD[i] == posD[j]; j++) {
    }
    cop.push_back(posD[i]);
    i = j;
  }
  posD = cop;
  return getCnt(A, 0);
}
int main() {
  long long A;
  cin >> A;
  cout << solve(A) << "\n";
  return 0;
}
