#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

int main() {
	ll d[20], n, x, y;
	cin >> n;
	REP(i, n){
		cin >> d[i];
	}
	cin >> x >> y;
	ll m = max(x, y);
	ll ans = INF;
	if(m == 0){
		ans = 0;
		cout << ans << endl;
	}else{
		ll dMax = 0;
		REP(i, n){
			if(m == d[i]) ans = 1;
			dMax = max(dMax, d[i]);
		}

		ll ans2 = m / dMax;
		if(ans2 > 0) ans2--;
		ll last = m - ans2 * dMax;
		if(last == dMax) ans2++;
		else if(last != 0) ans2 += 2;

		cout << min(ans, ans2) << endl;
	}
	return 0;
}