#include <bits/stdc++.h>
using namespace std;
void fast_io() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
}

int main() {
    fast_io();
    int n;
    cin >> n;
    int a[3];
    cin >> a[0] >> a[1] >> a[2];
    int need[3] = {3, 5, 10};
    vector<vector<int>> dp(4, vector<int>(n + 1));
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j <= n; j++) {
            dp[i + 1][j] = dp[i][j];
            if (j >= need[i]) {
                dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - need[i]] + a[i]);
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= n; i++) {
        ans = max(ans, dp[3][i]);
    }
    cout << ans << endl;
}