import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
ans = 0
t = b.pop()
c = [(b[i],a[i]) for i in range(4)]
c.sort(reverse=True)
while t >= 0 and c:
    x,cnt = c.pop()
    z = t // x
    z = min(z,cnt)
    ans += z
    t -= z * x
print(ans)