#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int n;
vector<int> vec;
vector<int> vec2;
bool prime[1263];
int dp[250][1<<12];

void dfs(int cur,int bit,int nbit,int val,int sum){
	//printf("%d %d %d %d %d\n",cur,bit,nbit,val,sum);
	if(val!=1)dp[cur+1][bit|nbit]=max(dp[cur+1][bit|nbit],sum+val);
	for(int i=0;i<vec2.size();i++){
		if(!(bit>>i & 1) && val*vec2[i]<=n){
			dfs(cur,bit,nbit|(1<<i),val*vec2[i],sum);
		}
	}
}

int main(void){
	scanf("%d",&n);
	memset(prime,true,sizeof(prime));
	prime[0]=false;
	prime[1]=false;
	for(int i=0;i<20;i++){
		vec.push_back(1);
	}
	for(int i=2;i<=n;i++){
		if(prime[i]){
			if(i*i<=n)vec2.push_back(i);
			else vec.push_back(i);
			for(int j=i*2;j<=n;j+=i){
				prime[j]=false;
			}
		}
	}
	for(int i=0;i<vec.size();i++){
		for(int j=0;j<(1<<(int)vec2.size());j++){
			dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
			dfs(i,j,0,vec[i],dp[i][j]);
		}
	}
	printf("%d\n",dp[vec.size()][(1<<vec2.size())-1]);
	return 0;
}