#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

ll N;
vector<ll> divisor(ll N) {
  vector<ll> res;
  for (ll i = 1; i * i <= N; i++) {
    if (N % i == 0) {
      res.push_back(i);
      if (i * i != N) res.push_back(N / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}

int main() {
  cin >> N;
  vector<ll> divs = divisor(N);
  cout << N - divs.size() << endl;
  return 0;
}