#include <fstream>
#include <iostream>

struct lst
{
    int i1;
    lst *urm,*prec;
}*dp[1000000],*l;

int i,j,n,s[8],v[8],m,sign;
long long sol;

using namespace std;

fstream f,g;

void bkt(int i)
{
    if(i<=m)
    {
        s[i]=1;
        sign*=-1;
        bkt(i+1);
        s[i]=0;
        sign*=-1;
        bkt(i+1);
    }
    else
    {
        int j,p=1;
        for(j=1;j<=m;j++)if(s[j]==1)p*=v[j];
        sol+=sign*(n-n/p);
    }
}

int main()
{
    f.open("fractii.in",ios_base::in);
    g.open("fractii.out",ios_base::out);
    f>>n;
    for(i=2;i<=n;i++)
    {
        dp[i]=new lst;
        dp[i]->urm=dp[i];
        dp[i]->prec=dp[i];
    }
    for(i=2;i<n;i++)if(dp[i]->urm==dp[i])for(j=i*2;j<=n;j+=i)
    {
        l=new lst;
        l->i1=i;
        l->urm=dp[j];
        l->prec=dp[j]->prec;
        dp[j]->prec->urm=l;
        dp[j]->prec=l;
    }
    sol=n;
    sign=-1;
    for(i=2;i<=n;i++)
    {
        if(dp[i]->urm==dp[i])
        {
            m=1;
            v[1]=i;
        }
        else for(m=0,l=dp[i]->urm;l!=dp[i];l=l->urm,m++)v[m+1]=l->i1;
        bkt(1);
    }
    g<<sol;
}