#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e6;
bool visited[MAXN];
const int maxn = 7e3;
vector<long long> V, H;
vector<long long> Q[maxn];
map<long long, int> W;
map<long long, int> E;
map<long long, bool> R;
int dp[maxn][maxn];
long long n;
void prime() {
  for (int i = 2; i < sqrt(n) + 2; i++) {
    for (int j = 0; j < V.size(); j++) {
      if (V[j] % i == 0) {
        R[V[j]] = 1;
      }
    }
  }
}
int check(long long p) {
  int h = 0;
  int h2 = 0;
  if (p == 1) {
    return 0;
  }
  for (long long i = 2; i < sqrt(p) + 2; i++) {
    if (p % i == 0 && !visited[i]) {
      while (p % i == 0) {
        p /= i;
      }
      h++;
      h2 = i;
      break;
    }
  }
  if (h == 1 && p == 1) {
    return h2;
  }
  if (h == 0 && !R[p]) {
    return p;
  }
  return 0;
}
int main() {
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  for (long long i = 2; i <= sqrt(n); i++) {
    if (!visited[i]) {
      for (long long j = 2; j * i <= sqrt(n) + 2; j++) {
        visited[i * j] = 1;
      }
    }
    if (n % i == 0) {
      long long j = n / i;
      if (i == j) {
        V.push_back(i);
      } else {
        V.push_back(i);
        V.push_back(j);
      }
    }
  }
  V.push_back(1);
  V.push_back(n);
  sort(V.begin(), V.end());
  for (int i = 0; i < V.size(); i++) {
    int x = check(V[i] - 1);
    if (x) {
      if (W.find(x) != W.end()) {
        Q[W[x]].push_back(V[i]);
      } else {
        W[x] = H.size();
        H.push_back(x);
        Q[W[x]].push_back(V[i]);
        Q[W[x]].push_back(1);
      }
    }
  }
  for (int i = 0; i < V.size(); i++) {
    E[V[i]] = i;
  }
  for (int j = 0; j < H.size(); j++) {
    dp[0][j] = 1;
  }
  for (int s = 0; s < Q[0].size(); s++) {
    dp[E[Q[0][s]]][0] = 1;
  }
  for (int i = 1; i < V.size(); i++) {
    for (int j = 1; j < H.size(); j++) {
      for (int s = 0; s < Q[j].size(); s++) {
        if (V[i] % Q[j][s] == 0) {
          dp[i][j] += dp[E[(V[i] / Q[j][s])]][j - 1];
        }
      }
    }
  }
  cout << dp[V.size() - 1][H.size() - 1] << endl;
}
