#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, A, B, C;
    cin >> N >> A >> B >> C;
    vector<ll> dp(N+1);
    for (int i=0; i<N; i++){
        if (i+3 <= N) dp[i+3] = max(dp[i+3], dp[i]+A);
        if (i+5 <= N) dp[i+5] = max(dp[i+5], dp[i]+B);
        if (i+10 <= N) dp[i+10] = max(dp[i+10], dp[i]+C);
    }

    cout << dp[N] << endl;

    return 0;
}