program fractii;
var s,i,j,n,a,b,x,y:integer;
     f1,f2:text;


function prim(a,b:integer):integer;
begin
for i:=1 to a do
  begin
   if (a mod i=0) and (b mod i=0) then
     y:=i;
   end;
prim:=y;
end;



begin
assign(f1,'fractii.in'); reset(f1);
assign(f2,'fractii.out'); rewrite(f2);
s:=0;
read(f1,n);
for i:=1 to n do
for j:=1 to n do
  begin
  x:=prim(i,j);
  if x=1 then
    s:=s+1;
  end;
write(f2,s);
close(f1);
close(f2);
end.