#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,nr,i,j,v[10000000],k,l;
int prim(int a, int b)
{
    while(a!=b)
        if(a>b)a=a-b;
        else b=b-a;
    return a;
}
int main()
{
    f>>n;
    for(i=1; i<=n; i++)
    {
       for(j=1;j<=n;j++)
         if(prim(i,j)!=1)v[j]=1;
        for(k=1; k<=n; k++)
            if(v[k]==1)v[k]=0;
            else nr++;
    }
    g<<nr;
    return 0;
}