#include <bits/stdc++.h>

using namespace std;

using ll = long long;

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> dp(2048, 0);
    
    for (int i = 2; i <= n; i++) {
        int mask = 0;
        for (int j = 0; j < 11; j++) {
            if (i % v[j] == 0) mask |= (1 << j);
        }

        for (int j = (1 << 11) - 1; j >= 0; j--) {
            if (j & mask) continue;
            dp[j | mask] = max(dp[j | mask], dp[j] + i);
        }
    }
    
    int ans = 0;
    for (int i = 0; i < (1 << 11); i++) {
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
    return 0;
}