from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

R, P, Q = map(int, input().split())
A, B, C, D = map(int, input().split())
A, B, C = sorted([A, B, C])
cnt = min(R//P, A)
R -= cnt*P
ans = cnt
A -= cnt
B -= cnt
C -= cnt
if A > 0:
    print(ans)
    exit()
if B > 0:
    cnt = min(R//(P+Q), B, D+C-B)
    R -= cnt*(P+Q)
    ans += cnt
    dnt = min(D, cnt)
    D -= dnt
    cnt -= dnt
    C -= cnt
if C > 0:
    cnt = min(R//(P+Q+Q), C, D//2)
    R -= cnt*(P+Q+Q)
    ans += cnt
    D -= cnt*2
    C -= cnt
if C > 0:
    cnt = min(R//(P+Q+Q), C//3)
    R -= cnt*(P+Q+Q)
    ans += cnt
    C -= cnt*3
if D > 0:
    cnt = min(R//(P+Q+Q+Q), D//3)
    R -= cnt*(P+Q+Q+Q)
    ans += cnt
    D -= cnt*3
print(ans)