#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> d(n);
    for (int &di: d) cin >> di;
    sort(d.begin(), d.end());
    int dmax = d.back();
    int x, y; cin >> x >> y;
    int ma = max(abs(x), abs(y));
    if (ma == 0) {
        cout << 0 << endl;
    } else if (ma == *lower_bound(begin(d), end(d), ma)) {
        cout << 1 << endl;
    } else if (ma < dmax * 2) {
        cout << 2 << endl;
    } else {
        cout << (ma + dmax - 1) / dmax << endl;
    }
    return 0;
}