import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
long[] D;
long X, Y;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = new long[N];
      foreach (i; 0 .. N) {
        D[i] = readLong();
      }
      X = readLong();
      Y = readLong();
      
      bool ok1;
      foreach (i; 0 .. N) {
        ok1 = ok1 || (max(abs(X), abs(Y)) == D[i]);
      }
      
      long ans;
      if (X == 0 && Y == 0) {
        ans = 0;
      } else if (ok1) {
        ans = 1;
      } else {
        const dMax = D.maxElement;
        ans = (max(abs(X), abs(Y)) + dMax - 1) / dMax;
        chmax(ans, 2);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}