#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI d(n);
  rep(i,n) cin >> d[i];
  sort(all(d));
  ll x,y;
  cin >> x >> y;
  ll maxDiff = max(abs(x),abs(y));
  rep(i,n) if(maxDiff == d[i]){
    cout << 1 << endl;
    return 0;
  }

  int cnt = (maxDiff - 2*d.back() ) / d.back();
  if(cnt > 0 ) maxDiff -= cnt * d.back();
  else cnt = 0;
  while(maxDiff > 2*d.back()){
    maxDiff -= d.back();
    cnt++;
  }
  //cerr <<"maxDiff -> "<<  maxDiff << endl;
  if(maxDiff == 0) cout << cnt << endl;
  else if(maxDiff == d.back()) cout << cnt + 1 << endl;
  else if(maxDiff <= 2*d.back()) cout << cnt + 2 << endl;
  else assert(false && "error");

  return 0;
}