n = int(input())
D = list(map(int, input().split()))
x, y = map(int, input().split())

maxD = max(D)
max_p = max(abs(x), abs(y))
if max_p == 0:
    print(0)
elif max_p < maxD:
    if max_p in D:
        print(1)
    else:
        print(2)
else:
    q, r = divmod(max_p, maxD)
    if r == 0:
        print(q)
    else:
        print(q + 1)