#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, x, y, d[20];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n;
	FOR(i, n) cin >> d[i];
	cin >> x >> y;
	
	if (x < y) swap(x, y);
	int ma = *max_element(d, d+n);
	
	int ret = x/ma;
	int _x = x % ma;
	if (_x == 0) {
		cout << ret << endl;
		return 0;
	}
	FOR(i, n) {
		if (_x == d[i]) {
			cout << ret+1 << endl;
			return 0;
		}
	}
	_x += ma;
	FOR(i, n) FOR(j, n) {
		bool ok = false;
		if (_x == d[i]+d[j]) ok = true;
		if (_x == abs(d[i]-d[j])) ok = true;
		if (ok) {
			cout << ret+1 << endl;
			return 0;
		}
	}

	cout << ret+2 << endl;
	return 0;
}