#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;

    // bit dp
    vector<ll> msk(N + 1);
    vector<ll> divs(N + 1);
    for (ll i = 2; i <= N; i++) {
        divs[i] = i;
    }

    vector<ll> small_pr = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
    for (ll i = 2; i <= N; i++) {
        for (ll j = 0; j < small_pr.size(); j++) {
            ll pr = small_pr[j];
            if (divs[i] % pr == 0) {
                while (divs[i] % pr == 0) {
                    divs[i] /= pr;
                }
                msk[i] |= (1 << j);
            }
        }
    }
    vector<vector<pll>> ps(N + 1, vector<pll>(0));
    for (ll i = 2; i <= N; i++) {
        ps[divs[i]].push_back(make_pair(i, msk[i]));
    }

    ll INF = 100000000000023;
    vector<ll> bitdp(1 << 12, -INF);
    bitdp[0] = 0;
    // まず 1 の領域に対してのみ bitdp をやる
    for (ll i = 0; i < ps[1].size(); i++) {
        vector<ll> nbitdp(1 << 12, -INF);
        for (ll j = 0; j < (1 << 12); j++) {
            nbitdp[j] = bitdp[j];
        }
        for (ll j = 0; j < (1 << 12); j++) {
            if (ps[1][i].second & j) {
                continue;
            }
            ll nval = (ps[1][i].second | j);
            nbitdp[nval] = max(nbitdp[nval], bitdp[j] + ps[1][i].first);
        }
        for (ll j = 0; j < (1 << 12); j++) {
            bitdp[j] = nbitdp[j];
        }
    }
    for (ll i = 2; i <= N; i++) {
        vector<ll> nbitdp(1 << 12, -INF);
        for (ll j = 0; j < (1 << 12); j++) {
            nbitdp[j] = bitdp[j];
        }
        for (ll k = 0; k < ps[i].size(); k++) {
            for (ll j = 0; j < (1 << 12); j++) {
                if (ps[i][k].second & j) {
                    continue;
                }
                ll nval = (ps[i][k].second | j);
                nbitdp[nval] = max(nbitdp[nval], bitdp[j] + ps[i][k].first);
            }
        }
        for (ll j = 0; j < (1 << 12); j++) {
            bitdp[j] = nbitdp[j];
        }
    }
    ll ans = -INF;
    for (ll i = 0; i < (1 << 12); i++) {
        ans = max(ans, bitdp[i]);
    }
    cout << ans << endl;
}