#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int a[101010];
int dp[1010101];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    sort(a, a + n);
    n = unique(a, a + n) - a;
    int b, c;
    scanf("%d%d", &b, &c);
    int sum = 0;
    while (b > c) {
      int next = b - 1;
      for (int i = 0; i < n; i++) {
        int to = b - b % a[i];
        if (to < c)
          a[i--] = a[--n];
        else if (to < next)
          next = to;
      }
      b = next;
      sum++;
    }
    printf("%d\n", sum);
  }
  return 0;
}
