#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll n; scanf("%lld", &n);
	vector<ll> d(n); for (ll i = 0; i < n; i++) scanf("%lld", &d[i]);
	sort(d.begin(), d.end());
	ll x, y; scanf("%lld %lld", &x, &y);
	x = llabs(x);
	y = llabs(y);
	if (x == 0 && y == 0) puts("0");
	else {
		ll dist = max(x, y);
		ll cnt = (dist - d.back()) / d.back();
		ll r = (dist - d.back()) % d.back();
		r += d.back();
		if (binary_search(d.begin(), d.end(), r)) cnt++;
		else cnt += 2;
		cout << cnt << endl;
	}
	return 0;
}