{$N+}
program fracti1;
const prime:array[1..169] of longint=(1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
  103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,
  257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,
  431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,
  607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,
  797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997);
var k,n,i,j,nr:longint;
    f:text;
    sol:extended;
    gasit:boolean;

function cmmdc(i,j:longint):longint;
begin
if j=0 then cmmdc:=i
else cmmdc:=cmmdc(j,i mod j);
end;

begin
assign(f,'fractii.in');reset(f);
readln(f,n);close(f);
assign(f,'fractii.out');rewrite(f);
sol:=1;
sol:=sol+n*(n-1);
nr:=0;
for i:=2 to n-1 do
 for j:=2 to n-i do
  begin
{   if ((i mod 2=0)and((i+j)mod 2=0))or(i mod (i+j)=0)or((i mod 3=0)and((i+j)mod 3=0)) then inc(nr)
      else if cmmdc(i,i+j)<>1 then inc(nr);}
      gasit:=false;
      k:=2;
      while (not(gasit))and(k<=169) do
       begin
        if (i mod prime[k]=0)and((i+j)mod prime[k]=0) then gasit:=true;
        inc(k);
       end;
      if gasit then inc(nr);
  end;
sol:=sol-2*nr;
writeln(f,sol:1:0);close(f);
end.