//#include <time.h>
#include <stdio.h>

int prime(long int nr1,long int nr2){
 while(nr1!=nr2){
 if(nr1>nr2)nr1-=nr2;
    else nr2-=nr1;
 }
 if(nr1==1)return 1;
 return 0;
}

int main(){
  long int i,j,N,numar=0,a;
  //time_t start, end;
  //start=clock();
  freopen("fractii.in","r",stdin);
  freopen("fractii.out","w",stdout);
  scanf("%ld",&N);
  numar=2*N-1;//pt prima linie si prima coloana, pe care nu o mai parcurg
  //printf("Pt linia si coloana 1 am pus %d\n",numar);
  a=(N-1)/2 + (N-1)/2;   
  numar+=a;
  //printf("Pt linia si coloana 2 am pus %d\n",a);
  for(i=3;i<=N;i++){
    for(j=3;j<=N;j++)
      {if(i!=j)
         if((i&1)||(j&1))
                     if(prime(i,j))//{
                        numar++;//printf("Adun 1 ==>%ld  PT %ld si %ld\n",numar,i,j);
                      //}
         //else printf("numerele %ld si %ld nu sunt prime intre ele!!!",i,j);
      }
   } 
  //end=clock();
   printf("%d\n",numar);
   //printf("Daca te mai intereseaza, timpul de excecutie este %2.6f\n",(end-start)/CLK_TCK);
  return 0;
  }