#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool is_prime(int n) {
    if (n % 2 == 0) return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return n != 1;
}

vector<int> divisor(int n) {
    vector<int> res;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            res.emplace_back(i);
            if (i != n / i) res.emplace_back(n / i);
        }
    }
    return res;
}

map<int, int> prime_factor(int n) {
    map<int, int> res;
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ++res[i];
            n /= i;
        }
    }
    if (n != 1) res[n] = 1;
    return res;
}

vector<int> sieve(int n) {
    vector<int> res;
    vector<bool> is_prime(n + 1, true);
    is_prime[0] = false;
    is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if (!is_prime[i]) continue;
        res.emplace_back(i);
        for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
    }
    return res;
}

int v[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> s = sieve(n);

    vector< vector<int> > num(s.size());
    for (int i = 2; i <= n; i++) {
        int j;
        for (j = (int)s.size() - 1; j >= 0; j--) {
            if (i % s[j] == 0) break;
        }
        num[j].push_back(i);
    }

    vector<int> dp(2048, -1);
    dp[0] = 0;

    for (int idx = 0; idx < num.size(); idx++) {
        vector<int> dp2(2048, -1);
        for (int i : num[idx]) {
            int mask = 0;
            for (int j = 0; j < 11; j++) {
                if (i % v[j] == 0) mask |= (1 << j);
            }

            for (int j = 0; j < (1 << 11); j++) {
                dp2[j] = max(dp2[j], dp[j]);
                if (j & mask) continue;
                if (dp[j] == -1) continue;
                dp2[j | mask] = max(dp2[j | mask], dp[j] + i);
            }
        }
        swap(dp, dp2);
    }

    int ans = 0;
    for (int i = 0; i < (1 << 11); i++) {
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
    return 0;
}