#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}
bool isPrime(ll num){
    if(num<2)           return false;
    else if(num==2)     return true;
    else if(num%2==0)   return false;
    for(ll i=3;i*i<=num;i+=2) if(num%i==0) return false;
    return true;
}



signed main(){
    // 2*3*(クソデカPrime)で遷移した後，5*(クソデカPrime)で遷移して，
    // (クソデカPrime)がダブる可能性があってかなりアなので
    // 最大素因数で集合ごと分けてシバくのがお気持ち


    ll n;cin>>n;
    vector<ll> p;
    rep(i,1300)if(isPrime(i)) p.push_back(i);
    
    vector<vector<ll>> g(p.size());
    for(ll i=2;i<=n;i++){
        int j;
        for(j=(int)p.size()-1;j>=0;j--){
            if(i%p[j]==0) break;
        }
        g[j].push_back(i);
    }

    const int m=12;
    ll dp[1<<m];
    rep(i,1<<m)dp[i]=0;

    for(auto &w:g){
        ll ndp[1<<m];
        rep(i,1<<m) ndp[i]=dp[i];
        for(auto &x:w){
            int mask=0;
            rep(i,m)if(x%p[i]==0) mask|=(1<<i);
            rep(bit,1<<m){
                if((bit&mask)==0) chmax(ndp[bit|mask],dp[bit]+x);
            }
        }
        rep(i,1<<m) dp[i]=ndp[i];
    }

    cout<<*max_element(dp,dp+(1<<m))<<endl;
    return 0;
}