n = int(input())
a,b,c = map(int,input().split())
dp = [0]+[-1]*(n+10)
for i in range(n+1):
    if dp[i-3]!=-1: dp[i] = max(dp[i],dp[i-3]+a)
    if dp[i-5]!=-1: dp[i] = max(dp[i],dp[i-5]+b)
    if dp[i-10]!=-1: dp[i] = max(dp[i],dp[i-10]+c)
print(max(dp[n],0))