#include    <iostream>
#include    <fstream>
#include    <algorithm>
using namespace std;

ifstream fin("fractii.in");
ofstream fout("fractii.out");

int prim[2000005],n,cnt;

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
      for(int j=1;j<=n;j++)
      {
         if(__gcd(i,j)==1)
            cnt++;
      }
      fout<<cnt;
}