#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define mp(a,b) make_pair(a,b)
using namespace std;typedef long long ll;typedef unsigned long long ull;int dx[] = { 1, -1 , 0 , 0};int dy[] = { 0,  0,  1, -1};

void solve() {
	int n;
	cin >> n;
	vi v;
	int maxi = -1;
	rep(i, n) {
		int a;
		cin >> a;
		maxi = max(maxi, a);
		v.push_back(a);
	}
	int x, y;
	cin >> x >> y;
	x = abs(x);
	y = abs(y);
	rep(i, n) {
		if (max(abs(x), abs(y)) == v[i]) {
			P(1);
			return;
		}
	}
	if (abs(x - maxi * 2) < 0 and abs(y - maxi * 2) < 0) {
		if (max(x, y) == maxi or (x == 0 and y == 0)) {
			P(1);
		}
		else {
			P(2);
		}
		return;
	}
	int cnt = max(abs(x / maxi - 1), abs(y / maxi - 1));
	x = x - ((x / maxi) - 1)*maxi;
	y = y - ((y / maxi) - 1)*maxi;
	if (max(abs(x), abs(y)) == maxi) {
		P(cnt + 1);
	}
	else {
		P(cnt + 2);
	}
}

int main() {
	solve();
	return 0;
}