#include<iostream.h>
#include<fstream.h>

int n,k;

int prim(int a, int b)
 {
	if(a!=1&&b!=1)
	{
	if(a>b) {int aux=a;
	         a=b; b=aux;}
	for (int o=2;o<=b;o++)
		if(a%o==0 && b%o==0) return 0;
	return 1;
    }
	return 0;
}

void fractii()
{
  for(int i=1;i<=n;i++)
	  for(int j=1;j<=n;j++)
		  if(prim(i,j)) k++;
}	
  int main()
  {
	  ifstream f; f.open("fractii.in");
	  ofstream g; g.open("fractii.out");
	  while(!f.eof())
	  {
		  k=0;
		  f>>n;
		  fractii();
		  g<<n*2-1+k<<endl;
	  }
	  
f.close();
g.close();
 
  return 1;
  }