#include<stdio.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#define LL long long
#define maxn 10000
using namespace std;
const int SIZE = 100000001;
int phi[SIZE];
void init()
{
int i, j;
memset(phi, 0, sizeof(phi));
phi[1] = 1;
for(int i = 2; i < SIZE; i++) if(!phi[i])
{
for(j = i; j < SIZE; j+=i)
{
if(!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i-1);
}
}
return ;
}
int main()
{
int n=0;
init();
while(scanf("%d",&n)!=EOF)
{
printf("%d\n",phi[n]);
}
#include<iostream>
#include<cstring>
#include<algorithm>
#define LL long long
#define maxn 10000
using namespace std;
const int SIZE = 100000001;
int phi[SIZE];
void init()
{
int i, j;
memset(phi, 0, sizeof(phi));
phi[1] = 1;
for(int i = 2; i < SIZE; i++) if(!phi[i])
{
for(j = i; j < SIZE; j+=i)
{
if(!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i-1);
}
}
return ;
}
int main()
{
int n=0;
init();
while(scanf("%d",&n)!=EOF)
{
printf("%d\n",phi[n]);
}
}
int euler(int n)
{
int ans=1;
int i;
for(i=2;i*i<=n;i++)
{
if(n%i==0)
{
n/=i;
ans*=i-1;
while(n%i==0)
{
n/=i;
ans*=i;
}
}
}
if(n>1)
ans*=n-1;
return ans;
}