#include <algorithm>
#include <map>
#include <vector>

namespace cplib {

std::map<long long, long long> prime_factorization(long long n) {
  std::map<long long, long long> res;
  if (n < 2) {
    return res;
  }
  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      res[i]++;
      n /= i;
    }
  }
  if (n > 1) {
    res[n]++;
  }
  return res;
}

std::vector<long long> divisors(long long n) {
  std::vector<long long> res;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      long long j = n / i;
      res.emplace_back(i);
      if (i != j) {
        res.emplace_back(j);
      }
    }
  }
  std::sort(res.begin(), res.end());
  return res;
}

}

#include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

void solve() {
  long long n;
  cin >> n;
  if (n <= 2) {
    cout << 0 << '\n';
  }
  auto ds = cplib::divisors(n);
  cout << n - ds.size() << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}