#include <bits/stdc++.h>
using namespace std;
const double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcounll(s);
}
template <class T>
T sqr(T x) {
  return x * x;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int n;
int a, b, x[MAXN];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i];
  cin >> a >> b;
  sort(x, x + n);
  n = unique(x, x + n) - x;
  int ans = 0;
  while (a > b) {
    int AN = a - 1;
    for (int i = 0; i < n; i++) {
      if (a - (a % x[i]) >= b) {
        AN = min(AN, a - (a % x[i]));
      }
    }
    a = AN;
    ans++;
    while (n > 0 && a - (a % x[n - 1]) < b) n--;
  }
  cout << ans;
}
