#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

ll gx, gy;

ll getAns(ll d){
	ll a;
	ll minD = min(gx,gy), maxD = max(gx,gy);

	a = minD / d;
	ll how = a;
	if(minD % d != 0){
		a++;
		maxD -= d;
	}
	maxD = abs(maxD);

	ll ans = a;
	if(maxD > how * d){
		ll ret = maxD / d;
		if(maxD % d != 0) {
			if(how == 0) ret += 2;
			else ret++;
		}
		ans += ret - how;
	}

	return ans;
}

int main() {
	ll d[100], n;
	cin >> n;
	REP(i, n){
		cin >> d[i];
	}
	cin >> gx >> gy;

	ll ans = INFLL;

	for(int i = 0;i < n;i++){
		ans = min(ans, getAns(d[i]));
	}

	cout << ans << endl;

	return 0;
}