#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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; }

using namespace std;
typedef long long ll;
using P = pair<int, int>;

class Eratosthenes{
    public:
    int m;
    vector<bool> is_prime;
    vector<int> primes;
    Eratosthenes(int m_){
        m = m_;
        init();
    }
    private:
    void init(){
        is_prime.assign(m+1, true);
        is_prime[0] = false, is_prime[1] = false;
        for(int i = 2; i <= m; i++){
            if(is_prime[i]){
                primes.push_back(i);
                for(int j = 2; i*j <= m; j++) is_prime[i*j] = false;
            }
        }
    }
};

vector<P> factorize(int n){
    int m = n;
    vector<P> ans;
    for(int i = 2; i*i <= n; i++){
        if(m%i == 0){
            int cnt = 0;
            while(m%i == 0){
                cnt++;
                m /= i;
            }
            ans.push_back(P(i, cnt));
        }
    }
    if(m != 1) ans.push_back(P(m, 1));
    return ans;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    Eratosthenes erat(n);
    int m = erat.primes.size();
    vector<int> p;
    for(int x : erat.primes){
        if(x*x > n) break;
        p.push_back(x);
    }
    int k = p.size();
    
    vector<vector<int>> facs(1<<k);
    for(int i = 2; i <= n; i++){
        auto v = factorize(i);
        int s = 0;
        for(auto [x, _]: v){
            if(x*x > n) {
                s = -1;
                break;
            }
            int idx = [&](int x){
                for(int i = 0; i < k; i++){
                    if(p[i] == x) return i;
                }
            }(x);
            s |= (1<<idx);
        }
        if(s > 0) facs[s].push_back(i);
    }
    facs[0].push_back(1);
    vector<int> u;
    for(int i = 0; i < (1<<k); i++) {
        if(!facs[i].empty()) u.push_back(i);
    }
    // for(int i = 0; i < (1<<k); i++){
    //     for(int x : facs[i]) cout << x << ' ';
    //     cout << endl;
    // }
    vector<vector<int>> dp(m+1, vector<int>(1<<k));
    for(int i = 0; i < (1<<k); i++){
        for(int j : u){
            if(i&j) continue;
            if(j == 0) continue;
            chmax(dp[k][i|j], dp[k][i]+facs[j].back());
        }
    }

    for(int i = k; i < m; i++){
        int q = erat.primes[i];
        for(int j = 0 ; j < (1<<k); j++){
            for(int l : u){
                if((j&l) != 0) continue;
                for(int f : facs[l]){
                    if(f*q <= n) {
                        chmax(dp[i+1][j+l], dp[i][j]+f*q); 
                    }
                }
            }
        }
    }
    cout << dp[m][(1<<k)-1] << endl;
}