#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>

using namespace std;

#define ll long long int
#define pll pair<double,ll>

vector<vector<ll>> dp;

int main()
{
    ll n;
    cin >> n;
    vector<ll> d(n);
    for(int i = 0;i < n;i++)
    {
        cin >> d[i];
    }
    ll x,y;
    cin >> x >> y;
    if(x == 0 && y == 0)
    {
        cout << 0 << endl;
        return 0;
    }
    ll upper = max(abs(x),abs(y));
    sort(d.begin(), d.end());
    for(int i = 0;i < d.size();i++)
    {
        if(upper == d[i])
        {
            cout << 1 << endl;
            return 0;
        }
    }
    if(upper < d.front())
    {
        cout << 2 << endl;
        return 0;
    }
    ll div = upper / d.back();
    if(upper < d.back())
    {
        div++;
    }
    ll mod = upper % d.back();
    if(mod > 0)
    {
        cout << div + 1 << endl;
        return 0;
    }
    cout << div << endl;
    return 0;
}