UVa 11064

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scl(n)             scanf("%lld",&n)
#define scf(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
/// Constants
#define eps                1e-9
#define inf                (1e9)+9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1000009

bool chk[100009];
vll prime;

void seive()
{
    memset(chk,0,sizeof(chk));
    chk[0]=1;
    chk[1]=1;
    for(int i=2;i<=100000;i++){
        if(chk[i]){
            continue;
        }
        prime.pb((ll)i);
        for(int j=2;i*j<=100000;j++){
            chk[i*j]=1;
        }
    }
}

ll phidiv(ll n)
{
    ll div=1;
    ll result=n;
    ll ans = n;
    bool flg=0;
    for(int i=0;prime[i]*prime[i]<=n;i++){
        if(n%prime[i]==0){
            flg=1;
            int cnt=1;
            while(n%prime[i]==0){
                n/=prime[i];
                cnt++;
            }
            div*=cnt;
            result-=result/prime[i];
        }
    }
    if(n>1){
        div*=2;
        result-=result/n;
    }
    div--;
    ans = ans-(result+div);
    return ans;
}

int main()
{
    seive();
    ll n;
    while(cin>>n && n){
        ll ans = phidiv(n);
        cout<<ans<<endl;
    }
    return 0;
}