#include <bits/stdc++.h>
// #include "atcoder/modint"

using i64 = long long;
// using Fp = atcoder::modint998244353;

int main() {
    i64 N;
    std::cin >> N;
    i64 A, B, C;
    std::cin >> A >> B >> C;

    std::vector<i64> dp(N + 1, -1);
    auto solve = [&](auto &&self, const int n) -> i64 {
        if (dp[n] != -1) return dp[n];
        i64 ret = 0;
        if (n >= 3) ret = std::max(ret, self(self, n - 3) + A);
        if (n >= 5) ret = std::max(ret, self(self, n - 5) + B);
        if (n >= 10) ret = std::max(ret, self(self, n - 10) + C);
        return dp[n] = ret;
    };
    std::cout << solve(solve, N) << std::endl;
}