#include<stdio.h>

int p[16]={2,3,5,7,11,13,17,19,23,29,31};
int max(int a,int b){if(a>b){return a;}return b;}

int main(){
  int n;
  int m,i,j,k,dp[2048]={0},ndp[2048]={0},f[16],q,r=0,x[16];
  int fl;
  scanf("%d",&n);
  for(i=2;i<=n;i++){
    for(j=0;j<11;j++){if(i%p[j]==0){f[j]=1;}else{f[j]=0;}}
    for(j=0;j<2048;j++){fl=1;m=j;q=0;
      for(k=0;k<11;k++){if(m%2==0 && f[k]==1){fl=0;break;}m/=2;}
      ndp[j]=max(dp[j],ndp[j]);
      if(fl){m=j;
        for(k=0;k<11;k++){if(m%2){x[k]=1;}else{x[k]=0;}m/=2;}
        m=0;
        for(k=10;k>=0;k--){m*=2;if(x[k]==1 && f[k]==0){m++;}}
        ndp[m]=max(ndp[m],dp[j]+i);
      }
    }
    for(j=0;j<2048;j++){dp[j]=ndp[j];ndp[j]=0;}
  }
  for(j=0;j<2048;j++){r=max(r,dp[j]);}
  printf("%d\n",r);
  return 0;
}