from collections.abc import Iterable


def accum_dp1(xs: Iterable, f, op, e, size: int, init: Iterable, *, is_reset=True):
    dp = [e] * size
    for i, v in init:
        dp[i] = v

    for x in xs:
        pp = [e] * size if is_reset else dp.copy()
        dp, pp = pp, dp
        for i in range(size):
            for p, v in f(i, pp[i], x):
                if not (0 <= p < size): continue
                dp[p] = op(dp[p], v)

    return dp


N = int(input())
A, B, C = map(int, input().split())


def f(i, v, x):
    for k, p in [(3, A), (5, B), (10, C)]:
        if i+k > N: break
        yield i+k, v+p


def op(a, b):
    return max(a, b)


dp = accum_dp1(range(N+1), f, op, 0, N+1, [], is_reset=False)
ans = dp[N]
print(ans)