#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n;
ll d[15];
ll x, y;

int main() {
	cin >> n;
	REP(i, n) scanf("%lld", d + i);
	cin >> x >> y;
	
	ll nec = max(abs(x), abs(y));
	
	sort(d, d + n, greater<ll>());
	
	ll ans;
	
	if (nec == 0) ans = 0;
	else if (find(d, d + n, nec) != d + n) ans = 1;
	else if (nec < d[0]) ans = 2;
	else ans = (nec + d[0] - 1) / d[0];
	
	cout << ans << endl;
	
	return 0;
}