#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int n;
	while (~scanf("%d", &n)) {
		vector<int> d(n);
		for (int i = 0; i < n; ++i)
			scanf("%d", &d[i]);
		int x; int y;
		scanf("%d%d", &x, &y);
		x = abs(x), y = abs(y);
		if (x < y) swap(x, y);
		int maxD = *max_element(d.begin(), d.end());
		int ans = max(2, (x + maxD - 1) / maxD);
		if (x == 0) ans = 0;
		rep(i, n) if (d[i] == x)
			ans = 1;
		printf("%d\n", ans);
	}
	return 0;
}