#include <cstdio>
const int MAXN=16;

int ans[MAXN],top,limit,re; //re can
int n,A,B,a[MAXN];

int gcd(int a,int b)
{
	int t;
	while(b!=0)
	{
		t=b;
		b=a%b;
		a=t;
	}
	return a;
}

int lcm(int a,int b)
{
	return a*b/gcd(a,b);
}

void dfs(int dep)
{
	if (dep==n)
	{
		if (top==0) return ;
		int t=8;
		for(int i=0;i<top;i++)
		{
			t=lcm(t,ans[i]);
		}
		if (top&1) re+=limit/t;	
		else re-=limit/t;
		return ;
	}
	dfs(dep+1);
	ans[top++]=a[dep];
	dfs(dep+1);
	top--;
}

int main()
{
	freopen("eight.in","r",stdin);
	freopen("eight.out","w",stdout);
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",a+i);
	}
	scanf("%d%d",&A,&B);
	int final=0;

	limit=B;re=0;
	dfs(0);
	final=B/8-re;

	limit=A-1;re=0;
	dfs(0);
	final-=(A-1)/8-re;
	printf("%d\n",final);
	return 0;
}