Number Theory

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<30)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (1<<17)
ll P[MX],L,cn[MX]={1,1};
void gen(void){
    for(int i(2);i<MX;++i)
        if(!cn[i]){
            P[L++]=i;
            for(int j(i<<1);j<MX;j+=i)
                cn[j]=1;
        }
}
ll sl(ll n){
    ll t(1),h(1);
    for(ll i(0),ct(0),d(1);P[i]*P[i]<=n;++i,ct=0,d=1){
        while(!(n%P[i]))
            n/=P[i],++ct,d*=P[i];
        t*=ct+1,h*=(d-d/P[i]);
    }
    if(n!=1)t<<=1,h*=n-1;
    return t+h-1;
}
int main(void){
    ll N;
    gen();
    while(~scanf("%lld",&N))printf("%lld\n",N-sl(N));
    return 0;
}