program bfracti;
var s,i,j,a,b,n,x,y,i1,k:longint;
     f1,f2:text;


function prim(a,b:longint):boolean;

begin
y:=0;
prim:=true;
if a<b then
  k:=a
  else
  k:=b;
for i1:=2 to k do
  begin
   if (a mod i1=0) and (b mod i1=0) then
     {y:=i1;}
     prim:=false;
     exit;
   end;
end;



begin
assign(f1,'fractii.in'); reset(f1);
assign(f2,'fractii.out'); rewrite(f2);
s:=1;
read(f1,n);
for i:=1 to n do

  begin
  for j:=1 to n do
  begin
   if i<>j then
      if (prim(i,j)) then
         s:=s+1;
   end;
  end;
write(f2,s);
close(f1);
close(f2);
end.