n = int(input())
a, b, c = map(int,input().split())
dp = [- 10 ** 18] * (n+1)
dp[0] = 0
v = [(3,a), (5,b), (10,c)]

for i in range(1, n+1):
	for x, y in v:
		if i - x < 0: continue
		dp[i] = max(dp[i], dp[i-x] + y)

print(max(dp))