#include<stdio.h>
#include<math.h>
#include<iostream.h>
   long long  p, i, j, l, n, a, k, suma;

  long long prim(long long a)
  { for(l=2;l*l<=a;l++)
     if(a%l==0)
       return 0;

   return 1;
  }

 long long phi(long long nr)
 { p=1;
   if(prim(nr)==1)
     return nr-1;


    for(j=2;j*j<=nr;j++)
    { k=0;
     if(prim(j)==1 && nr%j==0)
      {  while(nr%j==0)
         {  k++; nr=nr/j; }
       
       p=p*pow(j, k-1);
      }
    }

   return p;
 }


 int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out" "w", stdout);



scanf("%lld", &n);

for(i=2;i<=n;i++)
 suma=suma+phi(i);

printf("%lld", 2*suma+1);



return 0;
}