#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int N,x,y; cin >> N;
    vector<int> d(N);
    for(int i=0;i<N;i++){
        cin >> d[i];
    }

    cin >> x >> y;

    if( x==0 && y==0){
        cout << 0 << endl;
        return 0;
    }

    int dist = max(abs(x), abs(y));
    sort(d.begin(), d.end(), greater<int>());
    for(int i=0;i<N;i++){
        if(dist == d[i]){
            cout << 1 << endl;
            return 0;
        }
    }
    int d_max = d[0];

    if(dist < d_max){
        cout << 2 << endl;
    }else{
        cout << (dist + d_max - 1)/d_max << endl;
    }

    return 0;
}