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

dp = [0] * (N+1)
for i in range(N):
    for k, v in [(3, A), (5, B), (10, C)]:
        if i+k > N: break
        dp[i+k] = max(dp[i+k], dp[i] + v)

ans = dp[N]
print(ans)