program fractii;
var a,b,s,s1,a1,b1,r:longint;
    n:longint;
    f,g:text;
function prime(nr:longint):boolean;
var d:longint;
    prim:boolean;
begin
     d:=3;
     prim:=true;
     if ((nr mod 2=0)and(nr<>2))or (nr<=1) then prim:=false;
     while ( (d<=sqrt(nr)) and prim=true )do
     begin
          if nr mod d=0 then prim:=false;
          d:=d+2;
     end;
     prime:=prim;

end;


function cmmdc(a1,b1:longint):longint;
var r:longint;
begin
     repeat
           r:=a1 mod b1;
           a1:=b1;
           b1:=r;
     until r=0;
     cmmdc:=a1;
end;
begin
     assign(f,'fractii.in');
     assign(g,'fractii.out');
     reset(f);
     rewrite(g);
     read(f,n);
     s:=(n*n)-(n-1);
     for a:=1 to n do
     begin
          s1:=0;
          if prim(a) then c:=1;
          else
              begin
              for b:=2 to a-1 do
              begin
                   a1:=a;
                   b1:=b;
                   if (cmmdc(a1,b1)<>1) then inc(s1);
              end;
              end;
     end;
     s:=s-s1;
     write(g,s);
     close(f);
     close(g);
end.