#include <stdio.h>

int min(int p0,int p1){
  return(p0<p1?p0:p1);
}

int pow(int p0,int p1){
  int i,n=1;
  for(i=0;i<p1;i++){
    n*=p0;
  }
  return(n);
}

int main(){
  int n,i,j,k,l,m=0,a[200][46],b[200],p[46]={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};
  scanf("%d",&n);
  for(i=0;i<n;i++){
    k=i+1;
    for(j=0;j<46;j++){
      a[i][j]=0;
      while((k%p[j])==0){
        k/=p[j];
        a[i][j]++;
      }
    }
    b[i]=0;
  }
  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      l=1;
      for(k=0;k<46;k++){
        l*=pow(p[k],min(a[i][k],a[j][k]));
      }
      b[l]++;
    }
  }
  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      l=1;
      for(k=0;k<46;k++){
        l*=pow(p[k],min(a[i][k],a[j][k]));
      }
      m+=l*b[i];
    }
  }
  printf("%d",m);
  return(0);
}