#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;

const ll maxn_eratosthenes = 100005;
bool _is_prime[maxn_eratosthenes];

vll eratosthenes(const ll N)
{
  vll P;
  for (ll i = 0; i <= N; i++) {
    _is_prime[i] = true;
  }
  _is_prime[0]=_is_prime[1]=false;
  for (ll i = 2; i <= N; i++) {
    if (_is_prime[i]) {
      for (ll j = 2 * i; j <= N; j += i) {
        _is_prime[j] = false;
      }
      P.emplace_back(i);
    }
  }
  return P;
}

const ll maxn=1<<11; // 11 ... sqrt(1262) までの素数の個数

ll dp1[210][maxn]; // (√N以上の素数について)最大の素因数がi番目の素数までのものである数で作れる最大和、ただし√N未満の素数の使用状況はsである
ll dp2[maxn];      // (√N未満の素数について)素数の使用状況がsの時の最大和

signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  ll N; cin>>N;
  
  // cout<<eratosthenes(1262).size()<<endl;
  // cout<<eratosthenes(sqrt(1262)).size()<<endl;
  
  auto p=eratosthenes(N);
  auto rp=eratosthenes(sqrt(N)); // root Nまでの素数
  
  ll n=p.size(), m=rp.size();
  
  irep(i,m,n) rep(s,1<<m){
    for(ll j=1; j*p[i]<=N; j++){
      ll now=j*p[i];
      ll msk=0;
      rep(k,m) if(now%rp[k]==0) msk|=(1<<k);
      
      if((msk&s)==0) chmax(dp1[i+1][s|msk],dp1[i][s]+now);
    }
  }
  
  // 2~Nまでの単一の数についてdp2を更新
  for(ll i=2; i<=N; i++){
    ll s=0;  // iに含まれる√Nまでの素数
    ll ok=1; // iに√N以上の素数を含まないか
    rep(j,n){
      if(i%p[j]==0){
        if(j<m) s+=(1<<j);
        else ok=0;
      }
    }
    if(ok) chmax(dp2[s], i);
  }
  
  // 複数の数の組合せについてdp2を更新
  rep(s,1<<m) for(ll msk=s; msk>=0; msk--){
    msk&=s; // sになりmskのビットを削ぎ落す
    chmax(dp2[s],dp2[msk]+dp2[s-msk]);
  }
  
  ll ans=0;
  rep(s,1<<m) chmax(ans,dp1[n][s]+dp2[(1<<m)-1-s]);
  cout<<ans<<endl;
  
}