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

int main() {
    int n;
    cin >> n;
    vector<int> d(n);
    int max_d = 0;
    for(int i=0; i<n; ++i) {
        cin >> d[i];
        max_d = max(d[i], max_d);
    }
    int x, y;
    cin >> x >> y;
    x = abs(x), y = abs(y);
    if(x == 0 && y == 0) {
        cout << 0 << endl;
    } else if(find(d.begin(), d.end(), max(x, y)) != d.end()) {
        cout << 1 << endl;
    } else if(max(x, y) < max_d) {
        cout << 2 << endl;
    } else {
        cout << (max(x, y) + max_d - 1) / max_d << endl;
    }
}