import java.io.*;
import java.util.*;


public class Main_yukicoder467 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] d = new int[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}
		Arrays.sort(d);
		int maxd = d[n - 1];

		int x = Math.abs(sc.nextInt());
		int y = Math.abs(sc.nextInt());
		int maxx = Math.max(x, y);

		if (maxx % maxd == 0) {
			pr.println(maxx / maxd);
			return;
		} else {
			if (d.length > 1) {
				int cnt = maxx / maxd;
				SortedSet<Long> hs = new TreeSet<>();
				Queue<Long> hstmp = new ArrayDeque<>();
				for (int j = 0, size = d.length; j < size - 1; j++) {
					hs.add((long)d[j]);
				}

				for (int i = 0; hs.size() > 0 && i <= cnt; i++) {
					if (hs.contains((long)(maxx - maxd * (cnt - i)))) {
						pr.println(cnt + 1);
						return;
					}

					if (hs.last() + d[n - 2] < maxx - maxd * (cnt - i)) {
						break;
					}

					hstmp.clear();
					hstmp.addAll(hs.headSet((long)(maxx - maxd * (cnt - i))));
					hs.removeAll(hstmp);

					hstmp.clear();
					for (long e : hs) {
						for (int j = 0, size = d.length; j < size - 1; j++) {
							int e1 = d[j];
							hstmp.add(e + e1);
						}
					}
					hs.addAll(hstmp);
				}
			}

			if (x != y) {
				pr.println(Math.max(1, maxx / maxd) + 1);
			} else {
				pr.println(Math.max(1, maxx / maxd) + 1 + 1);
			}
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}