#include<iostream>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<tuple>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;


int main(){
    int N;
    cin>>N;
    ll A,B,C;
    cin>>A>>B>>C;

    vector<ll> dp(N+1,-INF);
    dp[0]=0;

    for(int i=0;i<=N;i++){
        if(i+3<=N){
            dp[i+3]=max(dp[i]+A,dp[i+3]);
        }
        if(i+5<=N){
            dp[i+5]=max(dp[i]+B,dp[i+5]);   
        }
        if(i+10<=N){
            dp[i+10]=max(dp[i]+C,dp[i+10]);   
        }
    }
    ll D=0;
    for(int i=0;i<=N;i++){
        D=max(D,dp[i]);
    }
    cout<<D<<endl;
}