#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>

using namespace std;

int main() {
	int n, x, y;
	cin >> n;

	vector<int> d(n, 0);
	for (int i = 0; i < n; i++) {
		cin >> d[i];
	}
	int d_max = *max_element(d.begin(), d.end());

	cin >> x >> y;
	int goal = max(abs(x), abs(y));

	int ans;

	if (goal == 0) {
		ans = 0;
	} else if (find(d.begin(), d.end(), goal) != d.end()) {
		ans = 1;
	} else if (goal <= 2 * d_max) {
		ans = 2;
	} else {
		ans = goal / (2 * d_max) * 2;
		goal %= 2 * d_max;
		if (goal > 0) {
			ans++;
		}
		if (goal > d_max) {
			ans++;
		}
	}

	cout << ans << endl;
	return 0;
}