#include <stdio.h>
#include <algorithm>
#include <vector>

using namespace std;

FILE *f,*g;
long i,j,n,contor,npedoi,temp;
vector<int> a();

int main()
{
  f=fopen("fractii.in","r");
  g=fopen("fractii.out","w");
  fscanf(f,"%ld\n",&n);
	contor=n*n-n+1;
  npedoi=n/2;
  if(n%2==1)
    npedoi++;
	for(i=2;i<=npedoi;i++)
	if(find(a.begin(),a.end(),i)!=a.end())
	  {
		  temp=0;
	    for(j=2;i*j<=n;j++)
			  {
		      contor-=2;
					temp++;
					a.push_back(i*j);
				}
			contor-=temp*(temp-1);
		}
  fprintf(g,"%ld\n",contor);
  fclose(f);   fclose(g);
  return 0;
}