N = int(input())
P = list(map(int, input().split()))
X = [3, 5, 10]
dp = [0] * (N + 1)
for i in range(1, N + 1) :
	for j in range(3) :
		if i >= X[j] :
			dp[i] = max(dp[i], dp[i - X[j]] + P[j])
print(dp[N])