#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int d[n];
    rep(i,n)cin >> d[i];
    int x, y;
    cin >> x >> y;
    if(abs(x) < abs(y))swap(x,y);
    if(x < 0){
        x *= -1; y *= -1;
    }
    if(x == 0){
        cout << 0 << endl;
        return 0;
    }
    rep(i,n){
        if(d[i] == x){
            cout << 1 << endl;
            return 0;
        }
    }
    int ma = 0;
    rep(i,n){
        ma = max(ma, d[i]);
        if(x < d[i]){
            cout << 2 << endl;
            return 0;
        }
    }

    int ans = (x - 1) / ma + 1;

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