#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <iomanip>
#include <cassert>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

void solve(){
   ll n;
   cin >> n;
   
   int cnt = 0;
   for (ll i = 1; i*i <= n;i++){
      if (n%i == 0 && i*i < n){
         cnt+=2;
      }
      else if (n%i == 0){
         cnt++;
      }
   }
   cout << n-cnt << endl;
   
   return;
}
  

int main(){
  int tt = 1;
  //cin >> tt;
  while(tt--){
	  solve();
  }
  return 0;
}